Selection Sort - Computer Science
Card 0 of 2
Question
What is the worst-case run-time of selection sort (in Big-O notation?)
What is the worst-case run-time of selection sort (in Big-O notation?)
Answer
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 
.
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
Compare your answer with the correct one above
Question
True or False.
Selection sort is quicker than MergeSort.
True or False.
Selection sort is quicker than MergeSort.
Answer
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.
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.
Compare your answer with the correct one above
Tap the card to reveal the answer