Problem: lab-week3- exercise01 Insertion sort

Problem

Analysis

Algorithm: Insertion Sort 插入排序

Code

Python

n=int(input())
if n==0:print()
else:a=list(map(int,input().split()))for i in range(1,n):j=iwhile a[j]<a[j-1] and j>=1:a[j],a[j-1]=a[j-1],a[j]j=j-1print(*a)

C++

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