Direct Insert Sort

Direct insertion sorting is a very simple sort, with the basic idea of inserting each record in a sorted sequence sequentially into a sorted sequence until all records are ordered.

In this process, in order to reduce the number of comparisons, set a sentinel in the array 0 subscript position.
Direct insert sorting is simple and intuitive, but less efficient, with a time complexity of O (N2), because a sentinel is required, so the spatial complexity is O (1).

Here is the implementation code:

#include <iostream>using namespacestd;intMain () {intr[ -]; intN; CIN>>N;  for(intI=1; i<=n; i++) cin>>R[i];  for(intI=1; i<=n; i++) {r[0]=R[i]; intJ;  for(j=i-1; r[0]<r[j]; j--) {r[j+1] =R[j]; } r[j+1]=r[0]; }     for(intI=1; i<=n; i++) cout<<r[i]<<" "; return 0;}

Direct Insert Sort