Problem
Given an ordered collection of integers of length equal to your five-digit moodle ID, where that collection contains the numbers from 0 to one less than your ID in that order, how many memory writes does it take to construct a binary max-heap by first copying the collection into an array, and then running buildMaxHeap on that array? (Count a swap as two writes, and don't forget the cost of the initial copy!) For example, for a collection of size 11342, the answer to this question is 34012.