Live briefing
Everything about Comparison sort
Type of sorting algorithm that works by comparing pairs of elements
A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation that determines which of two elements should occur first in the final sorted list. The only requirement is that the operator forms a total preorder over the data; that is:if a ≤ b and b ≤ c then a ≤ c (transitivity) for all a and b, a ≤ b or b ≤ a (connexity). Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Comparison sortA 5-minute orientation
- Skim a recent paper: Comparison Analysis of Bubble Sort Algorithm with Tim Sort Algorithm Sorting Against the Amount of DataInfluential work since 2022
- Pick up a classic book: C How to ProgramThe most-reprinted book on the subject
- Read the landmark paper: Comparison of Two Strategies for Collecting Q-Sort DataCited 16 times
- Go sideways: Binary searchA closely related topic
- Go sideways: HeapsortA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Comparison of Two Strategies for Collecting Q-Sort Data
Comparative Analysis between Selection Sort and Merge Sort Algorithms
A Performance Comparison of Sort and Scan Libraries for GPUs
Fire Extinguishing Agents: Sort and Comparison
A Comparison of Forced vs. Free Q-Sort Procedure
Parallel merge sort using comparison matrices. II
Parallel merge sort using comparison matrices. I
Sorting an array using the topological sort of a corresponding comparison graph
🆕 Influential since 2022
Comparison Analysis of Bubble Sort Algorithm with Tim Sort Algorithm Sorting Against the Amount of Data
A non comparison oblivious sort and its application to k-NN
Exchange Sort and Selection Sort Algorithms: Comparison and Theoretical Analysis
Comparison of Memory Efficiency and Computation Time of Bubble Sort, Insertion Sort, and Intro Sort Algorithms Using the C++ Programming Language
Comparison of the Efficiency of Bubble Sort and Insertion Sort Algorithms in Sorting Sales Data in Digital Printing
📚 Books worth reading
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Philosophie zoologiqueJean Baptiste Pierre Antoine de Monet de Lamarck · 1809
HadoopTom White, Tom White · 2009
Bioinformatics Research and ApplicationsZhipeng Cai · 2013
Database system conceptsAbraham Silberschatz · 1997
Automate the Boring Stuff with PythonAl Sweigart · 2015
Bibliography of continental drift and plate tectonicsTina Kasbeer · 1972
Discrete mathematicsNorman Biggs · 1985
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Binary search In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position…
- Heapsort In computer science, heapsort is an efficient, comparison-based sorting algorithm that reorganizes an input array into a heap (a data structure where each…
- Shellsort Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be understood as either a generalization of sorting by exchange…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Selection algorithm In computer science, a selection algorithm is an algorithm for finding the kth smallest value in a collection of orderable values, such as numbers. The…
- K-sorted sequence In computer science, a nearly-sorted sequence, also known as roughly-sorted sequence and as k-sorted sequence is a sequence which is almost ordered. By…
- Decision tree model In computational complexity theory, the decision tree model is the model of computation in which an algorithm can be considered to be a decision tree,…
- Binary logarithm In mathematics, the binary logarithm (log2 n) is the power to which the number 2 must be raised to obtain the value n. That is, for any real number x,…