All Computer Science Resources
Example Question #1 : Selection Sort
What is the worst-case run-time of selection sort (in Big-O notation?)
Selection sort is comprised of outer and inner for loops that swap elements of the unsorted array into a sorted array. The largest possible number of times each loop can run is the number of elements in the array. Thus, the worst possible run time is .
Example Question #41 : Standard Operations & Algorithms
True or False.
Selection sort is quicker than MergeSort.
MergeSort is has a running time of O(N). Selection sort has a running time of O(N2). Selection sort has O(N2) comparisons due to the swap in the algorithm.