MAX-HEAPIFY algorithm without recursion [closed]

MAX-HEAPIFY algorithm without recursion [closed]

References

Reference NO 1

http://math.stackexchange.com/questions/181022/worst-case-analysis-of-max-heapify-procedure

Reference NO 2

http://www.cs.utsa.edu/~wagner/CS3343/r6/r6ans.html

Reference NO 3

http://www.math.uic.edu/~leon/cs-mcs401-s08/handouts/nearly_complete.pdf

Reference NO 4

http://www.chegg.com/homework-help/questions-and-answers/write-efficient-max-heapify-uses-iterative-control-construct-loop-instead-recursion-q19365

Reference NO 5

http://www.cs.vassar.edu/~walter/cs241index/lectures/PDF/sorting.pdf

Reference NO 6

http://www.slideshare.net/himank31/heapify

Reference NO 7

http://en.wikipedia.org/wiki/Heapsort

Reference NO 8

http://www.cs.bgu.ac.il/~dsis052/uploads/43sol9.doc