Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with heap-sort
Search options answers only
not deleted
user 11647
Heapsort is an efficient comparison-based sorting algorithm that divides an input into a sorted and an unsorted part and iteratively shrinks the unsorted part by extracting the largest element and moving that to the sorted part. Run time is O(n log n).
3
votes
Accepted
Min-Heap in JavaScript
The code seems good to me. You have one bug and some unnecessary code.
First of all, it's not clear what types of values can be stored in the heap. It looks like it's supposed to be positive numbers …
- 8,462
3
votes
Min&Max Heap implementation in .NET
IHeap.cs
Why are you inheriting from IEnumerable<T> ? I don't see any reason why your heap would need to support the IEnumerable methods.
One typo: you put "parameter" instead of "element"
might wan …
- 8,462