选择排序(C-C++-实现)

Tue Sep 5, 2017

200 Words|Read in about 1 Min
Tags: 算法  

封装成函数:

//交换数组元素
void swap(int *a,int i,int j)
{
    int t = a[i];
    a[i] = a[j];
    a[j] = t;
}

//选择排序
void selection_sort(int *a,int len)
{
    int m = len-1; //以免每次循环判断都运算
    int i,j,k;
    for (i=0; i<m; i++)
    {
        k=i;
        for (j=i+1; j<len; j++)
        {
            if (a[j]<a[k])
            {
                k = j;
            }
        }
        if (k!=i)
        {
            swap(a,k,i);
        }
    }
}

测试:

#include <stdio.h>

//打印输出数组
void print_arr(int *a,int len)
{
    int i;
    if(len<1)  //数组长度必须大于0
    {
        printf("length greater than 0");
        return;
    }
    //打印整个数组
    printf("[");
    for(i=0; i<len-1; i++)
    {
        printf("%d ",a[i]);
    }
    printf("%d]\n",a[len-1]);
}

int main()
{
    int a[] = {9,0,6,5,8,2,1,7,4,3};
    int len = sizeof(a)/sizeof(int);
    print_arr(a,len);
    selection_sort(a,len);
    print_arr(a,len);
    return 0;
}

输出:

[9 0 6 5 8 2 1 7 4 3]
[0 1 2 3 4 5 6 7 8 9]

See Also

Tue Sep 5, 2017

200 Words|Read in about 1 Min
Tags: 算法