cpp-sorting-algorithms

Sorting algorithms like Merge,Quick,Bubble sort using C++

Merge Sort:

Merge sort is a divide-and-conquer algorithm

Complexity:

Average performance = O(nlogn)

Worst case = O(n) *Auxiliary linked list

Best case = O(nlogn)

Bubble Sort:

Complexity:

Average performance = O(n²)

Worst case = O(n²)

Best case = O(n)

Insertion Sort:

-> efficient for small data values.

-> works similar to the way you sort playing cards.

Complexity:

Average performance = O(n²)

Worst case = O(n²)

Best case = O(n)

Stable