Explore relationships

Selection sort

In computer science, selection sort is an in-place comparison sorting algorithm. It has a O(n2) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort.

Use + to expand a branch. Click a topic name to open its summary.