Sail E0 Webinar
Question
What is the worst case complexity of selection sort?
Options:
A .  O(nlogn)
B .  O(logn)
C .  O(n)
D .  O(n2)
Answer: Option D


Selection sort creates a sub-list, LHS of the 'min' element is already sorted and RHS is yet to be sorted. Starting with the first element the 'min' element moves towards the final element.



Was this answer helpful ?
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers