相关数组常见算法.pptVIP

有关数组的常见算法 Sorting Arrays Searching Arrays Search an array for a key value Linear search Simple Compare each element of array with key value Useful for small and unsorted arrays Binary search For sorted arrays only Compares middle element with key If equal, match found If key middle, looks in first half of array If key middle, looks in last half Repeat * * Sorting data Important computing application Virtually every organization must sort some data 排序 Bubble sort Selection sort 冒泡排序 选择排序 38 49 65 76 13 27 30 97 pass 1 38 49 65 13 27 30 76 pass 2 38 49 13 27 30 65 pass 3 38 13 27 30 49 pass 4 13 27 30 38 pass 5 13 27 30 pass 6 13 27 pass 7 49 38 65 97 76 13 27 30 初始关键字 n = 8 38 49 76 97 97 97 97 13 27 30 13 76 76 76 27 30 13 65 65 65 27 30 13 49 49 49 27 30 13 38 38 38 27 30 bubble sorting Initial values: 49 38 65 97 76 13 27 30 for (i = 0; i NUM-1; i++) // (NUM-1) trips for (j = 0; j NUM – i - 1; j++) if (a[j] a[j+1]) {//interchanging values t = a[j]; a[j] = a[j+1]; a[j+1] = t; } int a[NUM], i, j, t, flag; for (i = 0; i NUM-1; i++) //trips { flag = 0; for (j = 0; j NUM – i - 1; j++) if (a[j] a[j+1]) { t = a[j]; a[j] = a[j+1]; a[j+1] = t; flag = 1; } if (flag = = 0) break; } .Selection sort (选择排序) 初始：[ 49 38 65 97 76 13 27 ] j i = 1 13 49 一趟： 13 [ 38 65 97 76 49 27 ] i = 2 27 38 二趟： 13 27 [65 97 76 49 38 ] 三趟： 13 27 38 [97 76 49 65 ] 四趟： 13 27 38 49 [76 97 65 ] 五趟： 13 27 38 49 65 [97 76 ] 六趟： 13