选择和冒泡排序

  1 #include <stdio.h>
  2 
  3 int main()
  4 {
  5         int arr[5] = {4, 7, 9, 2, 6};
  6         int brr[5] = {7, 8, 4, 2, 1};
  7 /*冒泡排序*/
  8         int i, j, tmp=0, swap=0;
  9 
 10         for(i=0; i<5; i++)
 11                 for(j=0; j<4-i; j++){
 12                         if(arr[j] < arr[j+1]){
 13                                 tmp = arr[j];
 14                                 arr[j] = arr[j+1];
 15                                 arr[j+1] = tmp;
 16                         }
 17                 }
 18 /* 选择排序 */
 19         for(i=0; i<5; i++)
 20                 printf("%d \n", arr[i]);
 21 
 22         for(i=0; i<5; i++){
 23                 tmp = i;
 24                 for(j=i; j<5; j++){
 25                         if(brr[tmp] < brr[j])
 26                                 tmp = j;
 27                 }
 28                 swap = brr[i];
 29                 brr[i] = brr[tmp];
 30                 brr[tmp] = swap;
 31         }
 32         for(i=0; i<5; i++)
 33                 printf("%d \n", brr[i]);
 34 }