TK Memo
Sign in

Selection sort

Computer Science · Algorithms ⁨13⁩ views

Each pass finds the smallest remaining number and swaps it to the front. That swap can throw one equal 2 across the other. Time is O of n squared.

selection sortsortingunstable