算法导论学习 插入排序法

mac2022-06-30  24

#include < iostream > #include < stdio.h > using namespace std; int main(){ int a[ 101 ]; int n; scanf( " %d " , & n); for ( int i = 1 ;i <= n;i ++ ) scanf( " %d " , & a[i]); for ( int i = 2 ;i <= n;i ++ ) { int k = a[i]; int j = i - 1 ; while (j > 0 && a[j] > k) { a[j + 1 ] = a[j]; j -- ; } a[j + 1 ] = k; } for ( int i = 1 ;i <= n;i ++ ) printf( " %d " ,a[i]); return 0 ;}

转载于:https://www.cnblogs.com/cyiner/archive/2011/05/16/2048252.html

相关资源:JAVA上百实例源码以及开源项目
最新回复(0)