Everything about Proportion extend sort

🧭 Start here: a 6-step reading path

1. Read the overview: Proportion extend sortA 5-minute orientation
2. Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
3. Read the landmark paper: Proportion Extend SortCited 7 times
4. Go sideways: QuicksortA closely related topic
5. Go sideways: IntrosortA closely related topic

🏆 Landmark papers (most cited)

• Proportion Extend Sort

  Jing-Chao Chen · 2001 · SIAM Journal on Computing · 7 citations

📚 Books worth reading

• The Conspirators HierarchyJohn Coleman · 1992
• Devotion to the nine choirs of holy angelsHenri-Marie Boudon, Edward Healy Thompson · 1869
• 📕Origines ecclesiasticæJoseph Bingham · 1878
• Awareness Techniques - Book 1William Swygard · 1975
• Waldara AnswersWilliam Swygard · 1974
• The Human Planet · 2009
• A Heritage of Open Air Square Temple Discovered In Russia · 2010
• Prayer and actionErnest Edward Holmes · 1911

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
• Introsort Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance…
• 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…
• 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…
• Merge sort Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations…
• Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
• 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…
• 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…