Java HeapSort Help

[JavaHelp]

Implement heap sort by using the bottom-up insertion method.  Compare it to the performance of QuickSort and ShellSort.

I don't know where to put a comparisons/exchanges counter in the algorithm either.

Here is one implementation, but it's not the correct way I need it done, I don't think
https://gist.github.com/anonymous/97c1e8054576a8eed484bebf9b3c1c55
But nonetheless, where would the counters go?

Thanks

[Joel_Jantsen]

Hi,I can write you the respective algorithms and do the Asymptotic analysis for the same.Compare them on the basis of big O notations at the given order of N.Let me know ,I'm assuming this will be a paid job.