Search⌘ K
AI Features

Selection Sort

Explore the selection sort algorithm by learning how to divide an array into sorted and unsorted parts, repeatedly selecting the smallest element to sort efficiently. This lesson helps you grasp a foundational sorting technique crucial for solving array problems in competitive programming.

We'll cover the following...

Selection sort

Maintain two parts of the array, sorted and unsorted parts. Starting with the sorted part being empty and the unsorted part being A[0..N1 ...