冒泡

// 冒泡排序法.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include <stdio.h>void maopao(int* a, int n);int _tmain(int argc, _TCHAR* argv[]){        int array[5] = {1, 6, 7, 3, 10};    maopao(array, 5);    for (int i = 0; i < 5; ++i) {        printf("%d:%d  \n", i, array[i]);    }    return 0;}void maopao(int* a, int n) {    int i = 0;    int j = 0;        for (i = 0; i < n - 1; ++i) {        for (j = i + 1; j < n; ++j) {            if (a[i] > a [j]) {                int temp = a[i];                a[i] = a[j];                a[j] = temp;            }        }    }}