Describe an array of size n = 32 such that if it is the initial input to HeapSort in the order presented, no other permutation of the input will cause the algorithm to use more comparisons to sort the array. Explain why it does this. You do not (and should not) write out the entire array, but rather describe the order. You may wish to split your explanation for why so many comparisons happen into phases (heapify and then extract-Min phases).

The isometric projection camera technique provides an illusion of perspective by using things like parallax scrolling to create the illusion of 3d in a 2d game

1. declare a constant named cents_per_pound and initialize with 25. 2. get the shipping weight from user input storing the weight into shipweightpounds. 3. using flat_fee_cents and cents_per_pound constants, assign shipcostcents with the cost of shipping a package weighing shipweightpounds.

Consider a direct-mapped cache with 216 words in main memory. the cache has 16 blocks of 8 words each. it is a word-addressable computer (rather than a byte-addressable computer which we normally discuss). (a) how many blocks of main memory are there? (b) what is the format of a memory address as seen by the cache, that is, what are the sizes of the tag, cache block, and block offset fields (if they apply)? (c) to which cache block will the memory reference db6316 map?