EPISODE · May 22, 2020 · 10 MIN
Selection Sort
from Programmers · host Software Engineering
In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort
What this episode covers
In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort
NOW PLAYING
Selection Sort
No transcript for this episode yet
Similar Episodes
Jun 16, 2026 ·28m
Jun 14, 2026 ·31m
Jun 8, 2026 ·44m
Jun 2, 2026 ·45m
May 27, 2026 ·24m
May 25, 2026 ·43m