easy5 pts · first answer countssorting-and-searching
Swaps made by selection sort
Selection sort is sometimes chosen when writes are expensive (for example, on flash memory). How many swaps does it make on an array of n items in the worst case?
Discussion 0
Join free to post in the discussion.
Related questions
- Bubble sort best case with early exitBackend Developer
- What a stable sort meansBackend Developer
- Merge sort time in every caseBackend Developer
- Best simple sort for nearly sorted dataBackend Developer
- What in-place sorting meansBackend Developer
- Quick sort worst-case timeBackend Developer
- JavaScript default sort on numbersBackend Developer
- Comparator sign for ascending orderBackend Developer