About this document
Sorting Algorithms: Selection, Radix, Heapsort by JordanDelaCruz is a document available to read on EtoBox.
Selection sort is similar to bubble sort in that it uses nested loops to sort data. Like bubble sort, selection sort has an efficiency of O(n^2) because it requires n(n-1)/2 comparisons to sort data. Unlike bubble sort, selection sort cannot take advantage of already sorted data and will always require O(n^2) operations to complete regardless of how sorted the initial data is. Radix sort improves upon counting sort by sorting data based on individual digits rather than the entire value.
- Author
- JordanDelaCruz
- Language
- EN