Selection sort - Basic Algorithms Fast (2)

Selection sort picks up the smallest element in the unsorted list. It is swapped with the first element in the unsorted list if necessary. The sorted list is lengthened, while the unsorted list is shortened. The process continues until there is only one unsorted element left.

Playlist of my Algorithm walkthrough

Basic Python Fast

Playlist of my Python examples

Playlist of my Java course

Playlist of my Java examples

#selectionsort #algorithm #begincodingfast #algorithmvisualization