C++ 数组排序

从无序变成有序。

#include "stdafx.h"
#include <stdio.h>
#include<iostream>
using namespace std;
void sort_samll(int v[], int size);
void sort_big(int v[], int size);

int main() {
    int vn[] = { 21,25,26,48,12,69,74,49,83,22 };
    int len = sizeof(vn) / sizeof(int);           //计算数组长度
    for (int i = 0; i<len; i++)                    //输出排序前的数组
        cout << vn[i] << ",";
    cout << endl << endl;
    sort_big(vn, len);


    for (int i = 0; i<len; i++)                    //输出排序前的数组
        cout << vn[i] << ",";
    cout << endl << endl;

    double count = 0;
    for (int i = 0; i < 6; i++)
    {
        count += vn[i];
        cout << vn[i] << ",";

    }
    double avg = count / 5;

    cout << endl << endl;
    cout << count << ".";
    cout << endl << endl;
    cout << avg << ".";
    system("pause");
    return 0;
}
//从大到小
void sort_big(int v[], int size)
{
    int i, temp;
    for (int p = 1; p<size; p++)
    {
        for (i = 0; i<size - p; i++)
            if (v[i] <v[i + 1])
            {
                temp = v[i];
                v[i] = v[i + 1];
                v[i + 1] = temp;
            }
        /*for (i = 0; i<size; i++)
        cout << v[i] << ",";
        cout << endl;*/

    }
}
//从小到大
void sort_samll(int v[], int size)
{
    int i, temp;
    for (int p = 1; p<size; p++)
    {
        for (i = 0; i<size - p; i++)
            if (v[i]>v[i + 1])
            {
                temp = v[i];
                v[i] = v[i + 1];
                v[i + 1] = temp;
            }
        /*for (i = 0; i<size; i++)
            cout << v[i] << ",";
        cout << endl;*/

    }
}