question about heapsearch order
Posted
by davit-datuashvili
on Stack Overflow
See other posts from Stack Overflow
or by davit-datuashvili
Published on 2010-05-29T08:04:43Z
Indexed on
2010/05/29
8:12 UTC
Read the original article
Hit count: 164
algorithm
ia have meet following problem
suppose we have sorted array of size 2^k-1 where k is given number we should copy this array into heapsearch array b the elements in odd positions of a go in order into last half of the positions of b positions congruent to 2 modul0 4 go into b's secodn quarter and so on this is not homework and please nobody tag it as homework it is from programming pearls please any ideas
© Stack Overflow or respective owner