Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
marina 2023-08-02 13:40:47 -07:00 committed by GitHub
parent f7779dc6e3
commit b53b78285d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 27 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
heaps/README.md
View File

@ -245,3 +245,30 @@ class MaxHeap:
- using the heap to sort the input array
* heapsort traditionally uses a max-heap to sort the array, although a min-heap also works.
* this is not a stable sort.
<br>
----
### top k elements problem (`O(klog(N) + N)`)
<br>
1. construct a max (min) heap and add all elements into it (`O(N)`)
2. traverse and delete the top element, storing the value into a resulting array
3. repeat 2. until all k elements are removed (`O(k * log(N))`)
<br>
----
### the kth-element problem
<br>
1. construct a max (min) heap and add all elements into it (`O(N)`)
2. traverse and delete the top element
3. repeat 2. until k-th largest (smallest) is found (`O(k * log(N))`)
<br>