Problem: lab-week3- exercise03 Selection sort

Problem

Analysis

Algorithm: Selection Sort 选择排序

Code

Python

n=int(input())
if n==0:print()
else:a=list(map(int,input().split()))for i in range(n):m=ifor j in range(i+1,n):if a[j]<a[m]:m=ja[i],a[m]=a[m],a[i]print(*a)

C++

#include<cstdio>
#include<iostream>
using namespace std;
int n;
int a[200005];
int m;
int main(){cin>>n;if(!n){cout<<endl;return 0;}for(int i=1;i<=n;++i){cin>>a[i];}for(int i=1;i<=n;++i){m=i;for(int j=i+1;j<=n;++j){if(a[j]<a[m]){m=j;}}swap(a[i],a[m]);}for(int i=1;i<=n;++i){cout<<a[i]<<' ';}cout<<endl;return 0;
}