Question

Determine the complexity of following sorting algorithms(i) Quick sort(ii) Merge sort(iii) Bubble sort(iv) Heap sortShow all steps, performed to determine the complexity, withsuitable example for each.

Answer 1

For Normal logarithm loops we have time complexity of : O(n)
For Recursive loops logn