/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)`.
| | www.integralist.co.uk
Integralist
6.6 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,...
| | cp-algorithms.com
Introduction to Dynamic Programming - Algorithms for Competitive Programming
23.6 parsecs away

Travel
| The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.