泡沫排序与快速排序法.DOC

泡沫排序法(法1): int lowest = 0, temp=0; // ascending sorting for (int j=0; jtotal_item-1; j++) { lowest = j; for (int i=j+1; itotal_item; i++) if (a[i] a[lowest]) { temp= a[i]; a[i]= a[lowest]; a[lowest]= temp; //互換a[i]與a[lowest]之值; } } j=0 ? 4, 12, 56, 10, 6 j=1 ? 4, 10, 56, 12, 6 ? 4, 6, 56, 12, 10 j=2 ? 4, 6, 12, 56, 10 ? 4, 6, 10, 56, 12 j=3 ? 4, 6, 10, 12, 56 泡沫排序法(法2): int lowest = 0, temp=0; // ascending sorting for (int j=0; jtotal_item-1; j++) { lowest = j; for (int i=j+1; itotal_item; i++) if (a[i] a[lowest]) lowest = i; temp= a[j]; a[j]= a[