c:
#include <iostream>
using namespace std;
#define MAXSIZE 10
typedef struct
{
int r[MAXSIZE+1];
int length;
}SqList;
void swap(SqList *L, int i ,int j)
{
int temp =L-> r[i];
L-> r[i]=L-> r[j];
L-> r[j]=temp;
}
//简单选择排序算法
void SelectSort(SqList *L)
{
int i,j,min;
for (i=1;i<L ->length;j++)
{
min=i;
for(j=i+1;j<=L ->length;j++)
{
if(L->r[min]>L->r[j])
min=j;
}
if (i!=min)
swap(L,i,min);
}
}
int main()
{
SqList* L = ( SqList* ) malloc( sizeof( SqList ) );//分配内存,初始化
L ->length=9;
for(int i=1;i<=L->length;i++)
{
cin>>L ->r[i];
}
for(int i=1;i<=L->length;i++)
{
cout<<L ->r[i];
}
SelectSort(L);
for(int i=1;i<=L->length;i++)
{
cout<<L ->r[i];
}
}
Python:
L=[9,1,5,8,3,7,4,6,2]
def swap(L,i,j):
temp=L[i]
L[i]=L[j]
L[j]=temp
def SelectSort(L):
for i in range (0,len(L)):
min=i
for j in range (i+1,len(L)):
if L[min]>L[j]:
min=j
if i!=min:
swap(L,i,min)
if __name__ == "__main__":
SelectSort(L)
print(L)