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

C-6.24
Isabel has an interesting way of summing up the values in an array A of n
integers, where n is a power of two. She creates an array B of half the size of A
and sets B[i] = A[2i] +A[2i+ 1], for i = 0,1,..., (n/2) − 1. If B has size 1, then she
outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is
the running time of her algorithm?
Projects
P-6.1
Implement the array list ADT by means of an extendable array used in a circular
fashion, so that insertions and deletions at the beginning and end of the array list
run in constant time.
P-6.2
Implement the array list ADT using a doubly linked list. Show experimentally
that this implementation is worse than the array-based approach.
P-6.3
Write a simple text editor, which stores and displays a string of characters using
the list ADT, together with a cursor object that highlights a position in this
string. Your editor should support the following operations:
P-6.4
•
left: Move cursor left one character (do nothing if at text end).
•
right: Move cursor right one character (do nothing if at text end).
•
cut: Delete the character right of the cursor (do nothing at text end).
•
paste c: Insert the character c just after the cursor.
Implement a phased favorites list. A phase consists of N accesses in the list, for
a given parameter N. During a phase, the list should maintain itself so that
elements are ordered by decreasing access counts during that phase. At the end
371