HDU1040: As Easy As A+B

#include <bits/stdc++.h>
using namespace std;
int arr[1000],n;
void insertion_sort(){
  for(int j=1;j<n;j++){
    int key=arr[j];
    for(int i=j-1;;i--){
      if(i>=0&&arr[i]>key){
        arr[i+1]=arr[i];
      }else{
        arr[i+1]=key;
        break;
      }
    }
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    cin>>n;
    for(int i=0;i<n;i++)cin>>arr[i];
    insertion_sort();
    for(int i=0;i<n;i++)cout<<arr[i]<<(i==n-1?‘\n‘:‘ ‘);
  }
}

HDU1040: As Easy As A+B

原文：https://www.cnblogs.com/zjnu/p/9279897.html