Problem
Can you verify the correctness of your algorithms for Exercises 1 to 7?
Exercise 1
Write an algorithm that finds the largest number in a list (an array) of n numbers.
Exercise 7
Write an algorithm that determines whether or not an almost complete binary tree is a heap.