中国大学mocc笔记

//选择排序
//Knight 18:04:37
#include <stdio.h>
#include <stdlib.h>

int max(int a[],int len)
{
        int maxindex = 0;
        for(int i=1;i<len;i++)
        {
                if(a[i]>a[maxindex])
                {
                        maxindex = i;
                }
        }
        return maxindex;
}
int main(void)
{
        int a[] = {1,323,4325,54654657,5757342,4532};
        int len = sizeof(a)/sizeof(a[0]);

        for(int i = len-1;i>0;i--)
        {
                int maxindex = max(a,i+1);
                //swap a[maxindex],a[len-1]
                int t = a[maxindex];
                a[maxindex] = a[i];
                a[i] = t;
        }
        
        for(int i = 0;i<len;i++)
        {
                printf("%d ",a[i]);
        }
        

        system("pause");
        return 0;


}