数据结构及算法分析 第12章 答案 Larry Nyhoff 清华大学出版社.pdfVIP

Chapter 12 Chapter 12: Searching: Binary Trees and Hash Tables Exercises 12.1 1. 4, 6 2. 4, 1, 2, 3 3. 4, 6, 5 4. 4, 1, 0 5. 4, 6, 7, 8 6. template typename ElementType void linearSearch(ElementType x[], ElementType item, int capacity, int n, bool found, int loc) /* Linear search a list stored in an array x for an item, which is added at the end of the list, to improve performance. Precondition: n is the number of items in the array and is less than the arrays capacity. Postcondition: found is true and loc is the position of item if the search is successful; otherwise found is false and loc == n. */ { assert(n capacity); x[n] = item); loc = 0; while (x[loc] != item) loc++; found = loc != n; } 7. template typename ElementType void linearSearch(ElementType x[], ElementType item, int n, bool found, int loc) /* Linear search an ordered list stored in an array x for an item. Precondition: n is the number of items stored in the array. Postcondition: found is true and loc is the position of item if the search is successful; otherwise found is false. */ { loc = 0; while (loc n item x[loc]) loc++; found = (loc n x[loc] == item); } – 191 – Chapter 12 8. template typename ElementType void recLinearSearch(ElementType x[], ElementType item, int n, int start, bool found, int loc) /* Recursively linear search a list stored in an array x for an item. Precondition: n is the number of items in the array and 0 = start = n. Initial call is with start = 0. Post