数据结构专科辅导八（Data structure tutorial eight）.doc

数据结构专科辅导八（Data structure tutorial eight） Never sigh for the years that have gone, but must face the time that slips away. - Bly Hitt Data structure tutorial eight Sort of coaching exercises and answers (1) individual choice questions 1. if the n elements are directly inserted into the sorting, the number of elements in the ordered table is () before the I sort procedure is performed. A, N, B, n+1, C, n-1, D, 1 2. if the n elements are direct insertion sort, in the I Times Ranking, in order to find the most need to insert position (time) between elements, zeroth elements are assumed unknown key. A, N, B, n-1, C, n+1, D, 1 3. if the N element is directly inserted and sorted, in the case of sorting I, assuming that the insertion position of the element r[i+1] is r[j], the number of times the element is moved is (). A, J-I, B, i-j-1, C, I-J, D, i-j+1 4. if the N element is directly inserted and sorted, then the time complexity required to locate the insertion location is (). A, O (1), B, O (n), C, O (N2), D, O (log2n) 5. in the process of direct insertion of n elements, you need to go through (). A, N, B, n+1, C, n-1, D, 2n 6. direct insertion of n elements with a sorting time complexity of. A, O (1), B, O (n), C, O (N2), D, O (log2n) 7. in the process of bubble sorting of n elements, the first sort of sorting requires at most () the exchange between adjacent elements. A, N, B, n-1, C, n+1, D, n/2 8., in the process of bubbling n elements, the best time complexity is (). A, O (1), B, O (log2n), C, O (N2), D, O (n) 9. in the process of bubbling n elements, you need at least () to complete. A 1, B, N, C, n-1, D, n/2 In 10. of the n elements in the process of quick sort, if every time has been divided into the left, the number of elements in the two subintervals right of equal or only one, interval number with two or two elements of the sorting process is roughly (for). A, N, B, n/2, C, log2n, D, 2n 11. in the quick sorting of n elements, the first division requires the mo