JuliaCollections/DataStructures.jl
BinaryHeap constructor performs differently from heapify
Aberta
#639 aberto em 29 de jun. de 2020
enhancementgood first issue
Métricas do repositório
- Stars
- (745 estrelas)
- Métricas de merge de PR
- (Mesclagem média 1d 18h) (3 fundiu PRs em 30d)
Description
I noticed that BinaryHeap like BinaryMinHeap constructs a heap that just insert every element from an array to a empty heap. And the following x and y have the same order:
julia> nums = rand(1:20000, 2000);
julia> x = MutableBinaryMinHeap(nums);
julia> y = BinaryMinHeap(Int.([]));
julia> for i in nums
push!(y, i)
end
However, there is an O(N) heap-building algorithm instead of O(NlogN), and function heapify is an implement. So why not use heapify instead of insert successively？
Sincerely.