Everything about Introselect
Selection algorithm
In computer science, introselect is a selection algorithm that is a hybrid of quickselect and median of medians which has fast average performance and optimal worst-case performance. Introselect is related to the introsort sorting algorithm: these are analogous refinements of the basic quickselect and quicksort algorithms, in that they both start with the quick algorithm, which has good average performance and low overhead, but fall back to an optimal worst-case algorithm if the quick algorithm does not progress rapidly enough. Both algorithms were introduced by David Musser in, with the purpose of providing generic algorithms for the C++ Standard Library that have both fast average performance and optimal worst-case performance, thus allowing the performance requirements to be tightened. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: IntroselectA 5-minute orientation
- Go sideways: IntrosortA closely related topic
- Go sideways: QuickselectA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Introsort Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance…
- Quickselect In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list, also known as the kth order statistic…
- Median of medians In computer science, the median of medians is an approximate median selection algorithm, frequently used to supply a good pivot for an exact selection…
- Hybrid algorithm In mathematics and computer science, a hybrid algorithm is an algorithm that combines two or more other algorithms that solve the same problem, either…
- 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…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Partial sorting In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that its…
- 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…