= Interpolation sort
{wiki=Interpolation_sort}
Interpolation sort is a comparison-based sorting algorithm, which is not commonly used or widely recognized in comparison to other sorting algorithms like quicksort, mergesort, or bubblesort. The term often refers to a specific theoretical model of sorting that utilizes the concept of interpolation to determine the position of elements in a sorted array. However, it is worth noting that "interpolation sort" is not a standard term used in the literature of sorting algorithms.
Back to article page