C ++ implements insertion sorting (Code tutorial) and sorting tutorial

C ++ implements insertion sorting (Code tutorial) and sorting tutorial

The focus of insertion sorting is to push forward from the back to the front. Note that the processing at the end is different from other operations.

# Include

 
  
Using namespace std; int arr [1001]; void insert_sort (int n) {int tmp; for (int I = 1; I <n; I ++) {tmp = arr [I]; for (int j = I-1; j> = 0; j --) if (tmp <arr [j]) {arr [j + 1] = arr [j]; if (j = 0) {arr [0] = tmp; break ;} // arrive the end} else {arr [j + 1] = tmp; break ;}} int main () {int n; cin >> n; for (int I = 0; I <n; I ++) cin> arr [I]; insert_sort (n); for (int I = 0; I <n; I ++) cout <arr [I] <""; cout <endl ;}