nactyecenko / Sorting-by-choice

A simple algorithm. Finds the number of the minimum value in the list. Exchanges the found value with the value of the first unsorted position. Sorts the tail of the list, excluding the already sorted ones from consideration
0 stars 0 forks source link