排序:1. 直接插入排序代码：#include#include#define MAXSIZE 20typedef int keytype;typedef structkeytype key;redtype;typedef structredtype rMAXSIZE+1;int length;sqlist;void insertsort(sqlist &L)int i,j;for(i=2;i#include#define MAXSIZE 20typedef int keytype;typedef structkeytype key;redtype;typedef structredtype rMAXSIZE+1;int length;sqlist;void shellinsert(sqlist &L)int i,j,k,t,dlta10;printf(请输入排序的趟数:n);scanf(%d,&t);printf(请输入每趟排序的增量:n);for(i=1;i0&(L.r0.keyL.rj.key);j-=dltak)L.rj+dltak=L.rj;L.rj+dltak=L.r0;void main()int i;sqlist L;printf(请输入数据的长度:n);scanf(%d,&L.length);printf(请输入元素值:n);for(i=1;i=L.length;i+)scanf(%d,&L.ri.key);shellinsert(L);for(i=1;i=L.length;i+)printf( %d ,L.ri.key);运行结果：