1.

Explain the time complexity of selection sort. Also give its derivation

Answer»

Time Complexities of all SORTING Algorithms

Following is a quick revision sheet that you may refer at last minute

AlgorithmTime COMPLEXITY  BestAverageWorstSelection SortΩ(n^2)θ(n^2)O(n^2)Bubble SortΩ(n)θ(n^2)O(n^2)Insertion SortΩ(n)θ(n^2)O(n^2)Heap SortΩ(n LOG(n))θ(n log(n))O(n log(n))Quick SortΩ(n log(n))θ(n log(n))O(n^2)Merge SortΩ(n log(n))θ(n log(n))O(n log(n))Bucket SortΩ(n+k)θ(n+k)O(n^2)Radix SortΩ(NK)θ(nk)O(nk)


Discussion

No Comment Found

Related InterviewSolutions