冒泡排序法

#include <stdio.h> #define BUFFERSIZE 10 //升序 void sort_asce(int array[], int size) { int tmp; for(int i = 0; i < size - 1; i++) { for(int j = 0; j < size - 1 - i; j++) { if(array[j] > array[j + 1]) { tmp = array[j]; array[j] = array[j + 1]; array[j + 1] = tmp; } } } } //降序 void sort_desc(int array[], int size) { int tmp; for(int i = 0; i < size - 1; i++) { for(int j = 0; j < size - 1 - i; j++) { if(array[j] < array[j + 1]) { tmp = array[j]; array[j] = array[j + 1]; array[j + 1] = tmp; } } } } int main(int argc, char* argv[]) { printf("Hello Sort !\n"); int yx[BUFFERSIZE] = {2, 5, 9, 6, 4, 8, 1, 7, 0, 3}; printf("sort before:"); for(int ii = 0; ii < BUFFERSIZE; ii++) { printf(" %d", yx[ii]); } printf("\n"); sort_asce(yx, BUFFERSIZE); printf("sort after:"); for(int ii = 0; ii < BUFFERSIZE; ii++) { printf(" %d", yx[ii]); } printf("\n"); sort_desc(yx, BUFFERSIZE); printf("sort after:"); for(int ii = 0; ii < BUFFERSIZE; ii++) { printf(" %d", yx[ii]); } printf("\n"); return 0; }