Find the big-O running time of a sorting program that does the following:

  • It takes in a list of integers.
  • It iterates once through the list to find the largest element, and moves that element to the end.
  • It repeatedly finds the largest element in the unsorted portion by iterating once through, and moves that element to the end of the unsorted portion.

At the end, the list is sorted low to high.

(Also, try implementing this program in your language of choice.)


Problem Loading...

Note Loading...

Set Loading...