Skip to content

Computer Science

Algorithms

Sorting

Selection sort

  • Go through the list N times, each time swapping the ith element with the minimum found in the list.

Insertion sort

  • Go through the list N times, each time moving ith element backward such that elements 0 to i are sorted.

Quick-sort