- Is there a selection algorithm that runs in Θ(n) time? https://en.wikipedia.org/wiki/Median_of_medians 15 comments compsci
Linking pages
- GitHub - rekihattori/awesome-programmers: A list of history's greatest software engineers and tech pioneers https://github.com/rekihattori/awesome-programmers 44 comments
- Little libraries | Huon on the internet http://huonw.github.io/blog/2015/04/little-libraries/ 12 comments
- Quickselect Algorithm | Techie Delight http://www.techiedelight.com/quickselect-algorithm/ 12 comments
- The curious case of the always O(n*logn) QuickSort | by Šimon Tóth | ITNEXT https://itnext.io/the-curious-case-of-the-always-o-n-logn-quicksort-603b56230e6 8 comments
- GitHub - BenWiederhake/splaycompress: Compression utility using Splay Trees, named ".jan" after Robert Tarjan, to enable the file extension ".tar.jan". https://github.com/BenWiederhake/splaycompress?tab=readme-ov-file#splaycompress 1 comment
- The curious case of the always O(n*logn) QuickSort | by Šimon Tóth | ITNEXT https://itnext.io/the-curious-case-of-the-always-o-n-logn-quicksort-603b56230e6?gi=262a88a6ed3e 0 comments
- Nuclear Reactors and the Master Theorem – Welcome to Theoryland https://welcometotheoryland.wordpress.com/2017/07/08/nuclear-reactors-and-the-master-theorem/ 0 comments
- Course 1 — Algorithmic toolbox — Part 3: Divide and Conquer | by Phat Le | Towards Data Science https://medium.com/@ltanphat/course-1-algorithmic-toolbox-part-3-divide-and-conquer-dd9022bfa2c0 0 comments
- Grokking a “Quant” Interview https://willthompson.name/grok-quant-interview 0 comments
Would you like to stay up to date with Computer science? Checkout Computer science
Weekly.
Related searches:
Search whole site: site:en.wikipedia.org
Search title: Median of medians - Wikipedia
See how to search.