Adobe interview question
Explain few sorting algorithm. What are their complexities ?
Interview Answers
Anonymous
26 Nov 2011
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.