Last updated Unknown

Status: Tags: #cards/cmpt225/algos Links: Sorting Algorithms

Selection Sort

• Find smallest element and put in first position
• Continue until end of array, putting 2nd smallest in second position.. etc

Worst case comparisons and swaps

• Makes n(n-1)/2 comparisons
• Performs n-1 swaps

Big O

• Running time always ;; O(N^2) as it has to check every value onwards for every value

Implementation

Backlinks

1

list from Selection Sort AND !outgoing(Selection Sort)

References:

Created:: 2021-10-18 16:07