Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		mariusbancila.ro What is the C++ nth_element algorithm?
\|	\|	schadokar.dev Understand Quicksort the easy way · schadokar.dev	2.5 parsecs away Travel
\|	\|	Quicksort is one of the efficient sorting algorithms and the average complexity is `O(n log n)`.	2.5 parsecs away Travel
\|	\|	spin0r.wordpress.com How exactly to do linear time quickselect with duplicate elements? \| B³?	4.8 parsecs away Travel
\|	\|	It's well known that the quickselect algorithm, which runs in average case linear time, can be made linear time in the worst case as well, by using the median of medians strategy to select the pivot. This also allows us to implement quicksort in guaranteed $latex O(n \log n)$ time. While median-of-medians is theoretically interesting,...	4.8 parsecs away Travel
\|	\|	blog.reverberate.org Hoare's Rebuttal and Bubble Sort's Comeback	6.4 parsecs away Travel
\|	\|	Editor's note: For this blog entry I welcome my friend and colleague Gerben Stavengaas a guest author.	6.4 parsecs away Travel
\|	\|	funcall.blogspot.com Abstract Heresies: Advent of Code 2025	25.3 parsecs away Travel
\|		A blog about computers, functional languages, Lisp, and Scheme.	25.3 parsecs away Travel