Double Selection Sort is an optimized variation of Selection Sort that finds both the minimum and maximum elements in the unsorted region in each pass and places them at the beginning and end of the sorted region, respectively.
Paradigm
Selection
Author
Unknown
Tier
Time Complexity
Best
Avg
Worst
Space
O(1)
Properties