Computer Science 261

Assignment # 8

Due: 

• Part 1 will be due Monday, Nov. 12
• Part 2 will be due Thursday, Nov. 15

Purpose:

• To explore two "better than n^2" sorts
• To further explore the idea of linked structures

Add routines to VariousSorts.java to sort an integer array using Quicksort and ShellSort (including keeping track of comparisons and data moves), and modify the main routine to include tests of these two sorts in the same way that the main routine already tests bubble, insertion, and selection sorts. Make sure that you report on the number of comparisons, number of data moves, and total time in sorting.

Part 2:  Lisp-like linked lists.

Write a LispLinkObject to store a list of general objects. Include the following methods:

• constructor() (no arguments): construct an empty list
• boolean empty() : returns true if the list is empty, false otherwise
• Object first(): returns the object at the start of the list
• void cons(Object arg):adds arg to the beginning of the list
• void rest(): removes the object at the front of the list and returns the rest of the list:
• lint length(): returns the length of the list (0 if empty()).

(Note: to be more compatable with Lisp, the operators cons and rest would return new lists and not alter the old lists, but the above is sufficient for this exercise).

Implement this in any way you like, so long as you directly manipulate linked lists (i.e., don't use the Java built-in classes for this)

I'll provide a main() method for this shortly.

Questions?  Please ask!