opensource/developer-roadmap
3
0
Fork 0
mirror of https://github.com/kamranahmedse/developer-roadmap.git synced 2026-09-24 15:00:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: add comprehensive content for two heaps algorithm pattern

Browse Source 
* Update two-heaps@MGb8ufztTK75aXAyEAuaf.md

* Update two-heaps@MGb8ufztTK75aXAyEAuaf.md

* Update two-heaps@MGb8ufztTK75aXAyEAuaf.md
This commit is contained in:
remy
2025-09-08 18:50:48 +01:00
committed by GitHub
parent 85f2987532
commit ebe21f46ee
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/data/roadmaps/datastructures-and-algorithms/content/two-heaps@MGb8ufztTK75aXAyEAuaf.md
+7 -1
View File
@@ -1 +1,7 @@
# Two Heaps
# Two Heaps
The two heaps method uses a max-heap to store the lower half of the numbers and a min-heap to store the upper half. This setup allows you to quickly access the largest value of the lower half and the smallest value of the upper half in constant time. Insertions and deletions take logarithmic time, and the heaps are balanced so that the median can be found in O(1) time. This approach is especially useful for dynamically maintaining the median of a long or streaming data sequence, where repeatedly sorting the data would be inefficient (O(n log n) per sort).
Learn more from the following resources:
- [@article@Two Heaps — A Coding Pattern for Median-finding (Emre Bolat)](https://emre.me/coding-patterns/two-heaps/)
- [@video@Coding Pattern - Two Heaps (Imran Sarwar)](https://www.youtube.com/watch?v=9P7W5aEaatQ)