用直接插入法对R排序 /用希尔排序法对数据表R排序，D为增量序列，元素个数n，步长序列个数numOfD 用冒泡排序法对R排序 用直接选择排序法对R排序 堆排序 对有序表a[0]--a[n-1]进行一次二路归并排序，每个有序子表的长度为k

//一次二路归并排序后新的有序子表存于swap中

{ 用二路归并排序法对对象数组a[0]--a[n-1]排序

{-Direct insertion method to sort the R/R Hill sorting the data table sorting, D increments the sequence number of elements n, the step sequence number numOfD Bubble sort by direct R Sort Selection Sort R sort heap sort of ordered list of a [0]- a [n-1] one-way merge sort, the length of each ordered the child table is k// a way merge sort ordered child table stored in the swap way merge sort object array a [0]- a [n-1] {sort {