#include<stdio.h>
#include<iostream>
using namespace std;
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define ElemType int
typedef struct{
ElemType *elem;
int length;
int listsize;
}SqList;
//建顺序表
void InitList_Sq(SqList &L)
{
L.elem = (ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
if (!L.elem) cout << "存储分配失败!" << endl;
L.length = 0;
L.listsize = LIST_INIT_SIZE;
}
//打印
//void PrintL(SqList &L);
//在第i位置插入元素e
void ListInsert_Sq(SqList &L, int i, ElemType e)
{
int *newbase;
if (i<1 || i>L.length + 1) cout << "位置错误!" << endl;
if (L.length >= L.listsize)
{
newbase = (ElemType *)realloc(L.elem, (L.listsize + LISTINCREMENT)*sizeof(ElemType));
if (!newbase) cout << "重新分配地址错误!" << endl;
L.elem = newbase;
L.listsize += LISTINCREMENT;
}
int *p, *q;
q = &(L.elem[i - 1]);
for (p = &(L.elem[L.length - 1]); p >= q; --p) //将第i位置及其以后的元素后移一个位置
*(p + 1) = *p;
*q = e;
++L.length;
}
//选择排序
void SlectSort(SqList &L)
{
int i, t,j,k;
for (i = 0; i < L.length; ++i) //从第一个元素开始循环,查找要插入此位置的最小元素
{
k = i;
for (j=k+1 ; j < L.length; ++j) //从后n-i+1元素中找到最小元素
if (L.elem[k] > L.elem[j])
k = j;
if (i != k){ //如果最小元素的位置不是i位置,则互换
t = L.elem[i];
L.elem[i] = L.elem[k];
L.elem[k] = t;
//PrintL(L);
}
}
}
//打印
void PrintL(SqList &L)
{
int i = 0;
while (i < L.length)
{
cout << L.elem[i] << " ";
i++;
}
cout << endl;
}
void main()
{
SqList L;
//创建顺序表La并插入数据
InitList_Sq(L);
ListInsert_Sq(L, 1, 56); ListInsert_Sq(L, 2, 25);
ListInsert_Sq(L, 3, 98); ListInsert_Sq(L, 4, 12);
ListInsert_Sq(L, 5, 78); ListInsert_Sq(L, 6, 88);
ListInsert_Sq(L, 7, 39); ListInsert_Sq(L, 8, 95);
ListInsert_Sq(L, 9, 91); ListInsert_Sq(L, 10, 86);
ListInsert_Sq(L, 11, 80); ListInsert_Sq(L, 12, 99);
cout << "L 的元素为: ";
PrintL(L);
SlectSort(L);
cout << "选择排序后: ";
PrintL(L);
//防止运行结果一闪而过
system("pause");
}
c++实现简单选择排序
最新推荐文章于 2023-05-30 22:45:13 发布