This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: IE 170 Laboratory 4: Sorting Dr. T.K. Ralphs and Dr. J.T. Linderoth Due Feb 20, 2006 1 Laboratory Description and Procedures 1.1 Learning Objectives You should be able to do the following after completing this laboratory. 1. Understand heaps and the heap property. 2. Understand how to implement a heap with an array. 3. Understand the heapsort algorithm. 4. Gauge the impact of initial ordering on the effectiveness of different algorithms. 5. Understand the relationship of merging and sorting. 6. Understand how to select the sorting algorithm most appropriate for a given situation. 1.2 Key Words You should be able to define the following key words after completing this laboratory. 1. Heap 2. Heap sort 3. Insertion sort 1.3 Scenario MegaStore.com is a giant conglomerate that is in the business of acquiring companies. It then incorporates the acquired company’s catalog of products into its own. MegaStore.com has ac- quired the company ExoticBeer.com (from Laboratory #1). Thankfully, you have been retained by MegaStore.com as their Chief Algorithm Officer (CAO). As you learned in Laboratory 1, searching for a specified item (or word) in a dictionary can be done quickly if the list of items is sorted. However, not all of the companies that MegaStore.com acquires have nicely sorted catalogs. In fact, during one hostile takeover, a company even scrambled their own catalog data out of spite. Therefore, you will need to develop a sorting algorithm that can be used for sorting key words and/or merging various lists of keywords together....
View Full Document
This note was uploaded on 08/06/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .
- Spring '07
- Systems Engineering