vim wrote: > Is best worst and average case same for selection sort? > Tell me whether the time complexity depends on the basic steps. > plz plz plz
Selection sort is order independent, meaning it'll take the same amount of time regardless of the starting order. That should be enough information to figure out the best, average, and worst cases for the algorithm. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
