Comments on: Computer Algorithms: Heap and Heapsort

By: Soumen

Soumen — Wed, 25 May 2016 18:46:55 +0000

How do you make the figures(which software)?
They are great!

By: navaranjani

navaranjani — Sun, 02 Nov 2014 06:40:40 +0000

it is very tough

By: Samantha

Samantha — Sat, 19 Oct 2013 05:04:25 +0000

Clearly explained, simple and the graphics are really informative.
Thank you! 😀

By: nellkimz

nellkimz — Fri, 28 Dec 2012 14:14:25 +0000

hey thanks for explaining so much but just tell me that in this code “$a ,$l = $i*2 + 1;
$r = $i*2 + 2; ,$a[$l]) what does these things means??…please reply me soon
$a = array(1, 6, 3, 8, 2, 5, 4);

function heapify(&$a, &$i, &$heap_size)
{
$l = $i*2 + 1;
$r = $i*2 + 2;

if ($l < $heap_size && $a[$i] < $a[$l]) {
$largest = $l;
} else {
$largest = $i;

By: bhavesh

bhavesh — Fri, 30 Nov 2012 13:26:28 +0000

Thanks for taking so much effort in graphics specially – its appealing & helps to understand very quickly.
Very nice & lucid explanation.
Thanks for the post.

By: rashid padikkal

rashid padikkal — Tue, 30 Oct 2012 09:13:46 +0000

nice one.. It’s easy to understand..

By: Rahul

Rahul — Sat, 29 Sep 2012 18:32:38 +0000

Nice one….easy to understand…