Live briefing
Everything about Interpolation sort
Sorting algorithm in computer science
Interpolation sort is a sorting algorithm that uses an interpolation formula to divide and conquer. It is a variant of bucket sort. Data is assigned to buckets using an interpolation function:where and are the minimum and maximum values within the array, and the floor function is used. This function returns an array index to where element can be repositioned. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Interpolation sortA 5-minute orientation
- Skim a recent paper: The interplay of quaternary ammonium lipid structure and protein corona on lung-specific mRNA delivery by selective organ targeting (SORT) nanoparticlesInfluential work since 2022
- Pick up a classic book: NUMERICAL RECIPES IN CThe most-reprinted book on the subject
- Read the landmark paper: Interpolation Sort and Its Implementation with StringsCited 1 times
- Go sideways: Proxmap sortA closely related topic
- Go sideways: Bucket sortA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Interpolation Sort and Its Implementation with Strings
Implementasi Algoritma Insertion Sort dan Interpolation Search dalam Penentuan Member Berprestasi Di Asrama Bahasa
🆕 Influential since 2022
đź“š Books worth reading
NUMERICAL RECIPES IN CWilliam H. Press, Brian P. Flannery · 1988
The Conspirators HierarchyJohn Coleman · 1992
Numerical recipes in Fortran 90William H. Press, Saul A. Teukolsky · 1996
Computer algorithmsEllis Horowitz · 1997
Fundamentals of computer algorithmsEllis Horowitz · 1978
The (new) turing omnibusA.K. Dewdney · 1993
Coding the MatrixPhilip N. Klein · 2013
Data structures using C and C++Yedidyah Langsam · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Proxmap sort ProxmapSort, or Proxmap sort, is a sorting algorithm that works by partitioning an array of data items, or keys, into a number of "subarrays" (termed buckets…
- 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…
- Spreadsort Spreadsort is a sorting algorithm invented by Steven J. Ross in 2002. It combines concepts from distribution-based sorts, such as radix sort and bucket…
- Flashsort Flashsort is a distribution sorting algorithm showing linear computational complexity O(n) for uniformly distributed data sets and relatively little additional…
- Slowsort Slowsort is a sorting algorithm. It is of humorous nature and not useful for practical applications. It is a reluctant algorithm based on the principle…
- Pigeonhole sort Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number n of elements and the length N of the range of…
- 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…
- Radix sort In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according…