选择排序

最新推荐文章于 2024-03-22 17:14:14 发布

yanxiaopan

最新推荐文章于 2024-03-22 17:14:14 发布

阅读量267

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/yanxiaopan/article/details/53728019

版权

数据结构与算法专栏收录该内容

16 篇文章 0 订阅

订阅专栏

程序代码：

#include"stdio.h"
#include"stdlib.h"
#include<iostream>
using namespace std;

void swap(int &a, int &b)
{
    int c;
    c = a;
    a = b;
    b = c;
}

void select_sort(int a[], int n)
{
    printf("the unsort data is:");
    for (int i = 0; i < n; i++)
        printf("%d ", a[i]);
    cout << endl;
    int min;
    int i, j;
    int xiabiao;
    for (i = 0; i < n-1; i++)
    {
        min = 999;
        for (j = i; j < n; j++)
        {
            if (a[j] < min)
            {
                min = a[j];
                xiabiao = j;
            }               
        }
        swap(a[i], a[xiabiao]);
        printf("the %dth sort data is:",i+1);
        for (int i = 0; i < n; i++)
            printf("%d ", a[i]);
        cout << endl;
    }
    printf("the sort data is:");
    for (int i = 0; i < n; i++)
        printf("%d ", a[i]);
    cout << endl;
}

int main()
{
    int a[10] = { 2, 5, 1, 3, 8, 7, 6, 4, 10, 9 };
    select_sort(a, 10);

    system("pause");
    return 0;
}