选择排序算法练习

选择排序算法练习
Time Limit: 1000 MS Memory Limit: 32768 K
Total Submit: 316 (218 users) Total Accepted: 237 (215 users) Special Judge: No
Description
利用选择排序算法实现递增排序。
Input
输入一组整数
Output
输出递增的整数序列
Sample Input
2 1 5 4 3
Sample Output
1 2 3 4 5

#include<stdio.h>
#include<bits/stdc++.h>
#include<iostream>
#include<stdlib.h>
#define maxn 1005
#define ElemType int
#define OK 1
using namespace std;
typedef struct
{
    ElemType key;
} RcdType;
typedef struct
{
    ElemType *elem;
    int length;
    int listsize;
} sqlist;
sqlist start()
{
    sqlist l;
    l.elem=(int *)malloc(maxn *sizeof(ElemType));
    l.length=0;
    l.listsize=maxn;
    return l;
}
void insert1 (sqlist &l,ElemType e)
{
    l.elem[l.length]=e;
    l.length++;
}
int SelectSort(sqlist &L)//选择
{

        int n = L.length;
        for (int i = 0; i < n; i++) {
            int k = i;
            // 找出最小值的小标
            for (int j = i + 1; j < n; j++) {
                if (L.elem[j] < L.elem[k]) {
                    k = j;
                }
            }
            // 将最小值放到排序序列末尾
            if (k > i) {
                int tmp = L.elem[i];
                L.elem[i] = L.elem[k];
                L.elem[k] = tmp;
            }

}}
void output(sqlist &l)//输出
{
     for(int i=0; i<l.length; i++)
        printf("%d ",l.elem[i]);


}
int main()
{
    sqlist l;
    l=start();
    int a;
    while(~scanf("%d",&a))
    {
        insert1(l,a);
    }
SelectSort(l);
    output(l);
}