Live briefing
Everything about Selection sort
Sorting algorithm
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. Selection sort is noted for its simplicity and has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Selection sortA 5-minute orientation
- Skim a recent paper: Preparation of selective organ-targeting (SORT) lipid nanoparticles (LNPs) using multiple technical methods for tissue-specific mRNA deliveryInfluential work since 2022
- Pick up a classic book: Improved results for minimum-comparison selectionThe most-reprinted book on the subject
- Read the landmark paper: Implementation of the Selection Sort Algorithm to Sort Data in PHP Programming LanguageCited 22 times
- Go sideways: Insertion sortA closely related topic
- Go sideways: BogosortA closely related topic
đź“– Definitions
Noun A sorting algorithm that divides the input list into two sublists — items already sorted, and items not yet sorted — and gradually transfers elements from one list to the other.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Implementation of the Selection Sort Algorithm to Sort Data in PHP Programming Language
Neighborhood selection for I/sub DDQ/ outlier screening at wafer sort
Foreign market selection of suppliers through a novel REF-Sort technique
Comparative Analysis between Selection Sort and Merge Sort Algorithms
Some practical considerations in Q-sort item selection.
Selection-sort-based cooperative driving strategy for CAVs at non-signalized intersections
Improved Selection Sort Algorithm
Multiway replacement selection sort with dynamic reservoir
🆕 Influential since 2022
Preparation of selective organ-targeting (SORT) lipid nanoparticles (LNPs) using multiple technical methods for tissue-specific mRNA delivery
Did selection for seed traits across the Cretaceous/Paleogene boundary sort plants based on ploidy?
Analisis Study Komperatif Bubble Sort Dan Selection Sort Pada Algoritma Dan Pemograman Berdasarkan Seleksi Pengurutan
SISTEM INFORMASI APOTEK BERBASIS WEB MENGGUNAKAN ALGORITMA SEQUENTIAL SEARCH DAN SELECTION SORT
Adaptive hybrid sort: Dynamic strategy selection for optimal sorting across diverse data distributions
đź“š Books worth reading
- 📕Improved results for minimum-comparison selectionS. M. Johnson · 1974
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Insertion sort Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient…
- Bogosort In computer science, bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function…
- Merge sort Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations…
- Bucket sort Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted…
- Search data structure In computer science, a search data structure[citation needed] is any data structure that allows the efficient retrieval of specific items from a set of…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- Bubble sort Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the input list element by element, comparing…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…