Frage im Vorstellungsgespräch bei Adobe

Explain few sorting algorithm. What are their complexities ?

Antworten zu Vorstellungsgespräch

Anonym

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.

Anonym

16. März 2012

False. Merge sort is always nlogn.