ECE 198 Homework 8 Due Early Week 10, On-Time Week 11 Last modified: 6/3/2002

• Always write the time-complexity (in Big Oh notation) in a comment next to every method or function you write in this class.
• Use the test input and timers from homework 1.
• Note submitting any program that you did not write yourself is plagiarism - a very serious form of cheating. Anyone caught submitting a homework solution they did not author themselves will be prosecuted to the fullest extend of UCI law. Just as a reminder, please re-read my cheating policy. Cheating policy.
• Note you may use the algorithms from the text, from my notes, or from the web for this homework, but you must fix them so they work in this context.
• Note this homework is optional and what you do is your choice from the following options:
  • (100 points) Fully solve one of your missing homework assignments.
  • (100 points) Implement HeapSort and test compare to the sorts from the past.
  • (100 points) Implement a B-tree and test compare to the tables from the past.
  • (100 points) Implemente Ackermans function the obvious way and by using the Dynamic Programming technique discussed in lecture. Compute the first 45000 Ackerman's numbers using both implementations and compare their performance.
  • If you elect not to solve this homework, we will just use the first seven homeworks to compute your homework score.
• Write a driver program that allows the user to test each of your class implementations. Again use the PCTimer class to measure the sorting time for each of these sorting algorithms.
  • Again, be sure your main program takes arguments from the command line for input file name and output file name.
• What to submit:
  • Show your TA that your program works as described above.
  • Submit (and save) your program for future comparison with the others.