|
|
|
©2000 |
Due date: next Friday (10/6) before the class Problems: Implement The following sorting methods: 1. Merge sort 2. Quick sort 3. Heap Sort 4. Binary sort The program should be able to sort at least 10^6 items and report the run time. Description: 1. Your program should be able to read the input_file.txt and generate the output_file.txt. After running the program, your codes should have the following information: >> Sorting <---- your program name Input file: XXXXX <--- read the input file XXXXX Output file: XXXXX <---- generate the output file XXXXX ============================ Sorting Methods: 1. Merge Sort ============================ Choose the sorting method: 5 <--- do all of them
2. The input items are not only integers but also floating-points. 3. There are some comments after grading homework 1. On your report, briefly write down description, discussion, and how to run your program. On your codes, write down the comments. Remember to send your c or c++ files including header files that you write to TA by e-mail. It is very important that your code can function correctly. The other concerns on your programs are reusable and efficient. So, we recommend you to write your program with classes or functions. Submission: Please submit a paper version( before class ) and electronic version( by e-mail ) to TA.
|
|
Electrical and Computer Engineering ~ University of
Wisconsin-Madison ~ 1415 Engineering Drive Madison, WI 53706-1691 ~ Tel:
608/262-3840 ~ Fax: 608/262-1267 |
