Explain few sorting algorithm. What are their complexities ?
Utilisateur anonyme
Common sorting algorithms are quick sort, heap sort, merge sort. Heap sort has nlogn order for all cases. Quick sort has average order nlogn but worst case can be n^2. Same with merge sort.