Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Describe an in-place version of the selection-sort algorithm that uses only O(1)
space for instance variables in addition to an input array itself.
C-8.8
Assuming the input to the sorting problem is given in an array A, describe how
to implement the insertion-sort algorithm using only the array A and, at most,
six additional (base-type) variables.
C-8.9
Describe how to implement the heap-sort algorithm using, at most, six integer
variables in addition to an input array itself.
C-8.10
Describe a sequence of n insertions in a heap that requires Ω(nlogn) time to
process.
C-8.11
An alternative method for finding the last node during an insertion in a heap T is
to store, in the last node and each external node of T, a reference to the external
node immediately to its right (wrapping to the first node in the next lower level
for the right-most external node). Show how to maintain such references in O(1)
time per operation of the priority queue ADT assuming T is implemented as a
linked structure.
C-8.12
Describe an implementation of complete binary tree T by means of a linked
structure and a reference to the last node. In particular, show how to update the
reference to the last node after operations add and remove in O(logn) time,
where n is the current number of nodes of T. Be sure and handle all possible
cases, as illustrated in Figure 8.12.
Figure 8.12: Updating the last node in a complete
binary tree after operation add or remove. Node w is
the last node before operation add or after operation
remove. Node z is the last node after operation add or
before operation remove.
508