记住插入排序的方法

#include<iostream>

using namespace std;

#define maxn 10007
int main(){
	
	int n;
	int a[maxn];
	
	while(cin >> n){
		for(int i=0;i < n;i++){
			cin >> a[i];
		}
		
		//插入排序
		for(int i = 0;i<n;i++){
			int temp = a[i];
			int p = i-1;
			while((p >= 0)&&(temp <a[p])){
				a[p+1] = a[p];
				p --;
			}
			a[p+1] = temp;
		}
		
		for(int i = 0;i< n;i++){
			cout << a[i]<<" ";
		} 
	}
	
	return 0;
}

对于排序的过程有疑问，可以参考

https://blog.csdn.net/weixin_42109012/article/details/91478883?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522160268541319725271700060%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=160268541319725271700060&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_v2~rank_v28-1-91478883.first_rank_ecpm_v3_pc_rank_v2&utm_term=c%2Fc%2B%2B%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F&spm=1018.2118.3001.4187

 

本篇文章，在代码码的过程中，对插入算法那一块有很大问题，所以，没着急写如何记忆。