2: Assignment Heap Sort (Due: Monday, October 27th 2008, 11:59pm)
Forbes list of 50 richest people in the world for year 2007 was recently released. The attached forbes50.list is a copy of that list with the first name, last name and net worth in billions. Part A: Implement heap sort and use it to rewrite the list in ascending order. Use the persons first name as the key. Sample Input: 4 John Doe 50 Peter Han 44 Pete Willis 35 Jane Doe 24 Sample Output: 4 Jane Doe 24 John Doe 50 Pete Willis 35 Peter Han 44 Refer to chapter 6 of the textbook for additional information. Part B: i) State the complexity of YOUR algorithm using big-Oh notation. Complexity will be based upon the loops and various statements executed by your algorithm to perform sorting. ii) What is the complexity of the heap construction step alone, in big-Oh notation for your algorithm? iii) What is the complexity of the selection step, in big-Oh notation for your algorithm? Implementation Aspects The program must accept a command-line argument corresponding to the name of a .list file. The file is a simple text file in the following format. Number_of_Entries First_Name Last_Name Net_Worth_in_Billions Your program must be able to load any number of entries. Test cases with 100-1000 entries may be used to test your program. Java string class which is available in the default java.lang may package be used to load the dataset. File IO operations for reading and writing text files will require you to include import java.io.* statement in your .java file.
The output of your heap sort implementation (i.e. a sorted list of names with corresponding net worth) should be written into a ForbesSort.txt file. The format of this file will be as shown in the above sample output and is similar to input file format. Submission Details: Use your editor to create a Java file named hw2heap.java. The file should state your name and assignment number in a comment. Compile and execute your code as in hw1. A brief text file, hw2.txt, must be submitted as well that shows all executions. Limit the number of print statements to a maximum of 15. Also include your name and student ID in the hw2.txt file. Checklist: In the hw2 directory, you should have the following files in your unix account: hw2heap.java hw2.txt ForbesSort.txt You will need to run the turnin114 script to make the submission. To do this, type /ecelib/bin/turnin114 to copy your files from your working directory for final submission. This script only works on the machines malibu.eecs.uci.edu and vivian.eecs.uci.edu. For more information on java programming, submitting files, typescript, unix commands and java editors, please refer to Assignment 1. Due : October 27th, 2008 (11:59pm)