算法导论课程作业答案.pdfVIP

Introduction to Algorithms Massachusetts Institute of Technology 6.046J/18.410J Singapore-MIT Alliance SMA5503 Professors Erik Demaine, Lee Wee Sun, and Charles E. Leiserson Handout 10 Diagnostic Test Solutions Problem 1 Consider the following pseudocode: ROUTINE 1 if 2 then return 3 else return ROUTINE (a) Give a one-sentence description of what ROUTINE does. (Remember, don’t guess.) Solution: The routine gives the sum from to . (b) Give a precondition for the routine to work correctly. Solution: The value must be greater than ; otherwise, the routine loops forever. (c) Give a one-sentence description of a faster implementation of the same routine. Solution: Return the value . Problem 2 Give a short (1–2-sentence) description of each of the following data structures: (a) FIFO queue Solution: A dynamic set where the element removed is always the one that has been in the set for the longest time. (b) Priority queue Solution: A dynamic set where each element has an associated priority value. The element removed is the element with the highest (or lowest) priority. 2 Handout 10: Diagnostic Test Solutions (c) Hash table Solution: A dynamic set where the location of an element is computed using a function of the element’s key. Problem 3 Using -notation, describe the worst-case running time of the best algorithm that you know for each of the following: (a) Finding an element in a sorted array. Solution: (b) Finding an element in a sorted linked-list. Solution: (c) Inserting an element in a sorted array, once the position is found. Solution: (d) Inserting an element in a sorted linked-list, once the position is f