Thanks
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For mor
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
