Comparison of Sorting Algorithms You are required to implement all the sorting algorithms (Bubble, Selection, Insertion...

time complexities:

Bubble Sort -
best - n
worst - n^2

selection Sort -
best - n^2
worst - n^2

insertion sort -
best - n
worst - n^2

Merge Sort -
best - n log(n)
worst - n log(n)

Qucik sort -
best - n log(n)
worst - n^2

The bubble sort is one of the slowest sorting algorithms, but it is also one of the easiest sorts to implement.

selection sort works by starting at the beginning of the array and comparing the first element with the remaining elements.

After examining all the elements, the smallest element is placed in the first position of the array, and the algorithm moves to

the second position.

This process continues until the data is sorted.

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient

on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides\

several advantages.

The Quicksort algorithm is one of the fastest sorting algorithms for large data sets. Quicksort is a divide-and-conquer

algorithm that recursively breaks a list of data into successively smaller sublists consisting of the smaller elements and the

larger elements. The algorithm continues this process until all the data in the list is sorted.

The algorithm divides the list into

sublists by selecting one element of the list as a pivot. Data is sorted around the pivot by moving elements less than the pivot

to the bottom of the list and elements that are greater than the pivot to the top of the list.

MergeSort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then

merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, l, m, r) is key process that

assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one.