When performing a Heap Sort in ascending order, choose which of two starting arrays require the fewest comparisons.
This is a companion discussion topic for the original entry at https://www.raywenderlich.com/11447782-kotlin-whiteboard/lessons/37
This is a companion discussion topic for the original entry at https://www.raywenderlich.com/11447782-kotlin-whiteboard/lessons/37