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

Convert logical infix expression to postfix expression and evaluate using starting code I will provide.
I would just google for help, but I can't find any instance of this being done the way I need it.

PM for details, shouldn't be too hard for a decent programmer.

Thanks