Which feature of heaps allows them to be efficiently implemented using a partially filled array?

What happens if you make a recursive call without making the problem smaller?

Tree algorithms typically run in time O(d) . What is d?

Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))?

The expression score[5] is pronounced ________.

The elements of an array are stored in __________ storage locations in the computer?s memory.

A variable or a value listed in a call to a method is called ________.

A two-dimensional array can be viewed as ___________ and _____________.

A three-dimensional array can be thought of as ________ of two-dimensional arrays.