Selection Sort in 1 Video | Theory + Code + Complexity Analysis | Sorting Algorithms
Jenny's Lectures CS IT · 31:38 · Watch on YouTube
Selection sort splits the array into a sorted part and an unsorted part. On each pass it finds the smallest element in the unsorted part and makes one swap to put it at the front. It always makes about n²/2 comparison...