Introduction - If you have any usage issues, please Google them yourself
with super detailed explanation (not read the Wall for 10 days!) A practical question : Sort Hill (Shell Sort) is inserted into a sort. By D. L. Shell made in 1959 and named after. It is also known as the "narrow incremental method" in the time-efficient than inserted, such as sorting algorithms and bubbling there has been a big improvement. The disorder can sequence by law must rank. Two mathematical models : first getting a less than n integers d1 as an increment. all documents should be recorded into d1 groups. All distance dl in multiples of record on the same group. In the first group for direct insertion sorting; Then, take a second increment d2
Packet : 57578866shellsort111.rar filelist
ShellSort
ShellSort\ShellSort.opt
ShellSort\ShellSort.cpp
ShellSort\StdAfx.h
ShellSort\StdAfx.cpp
ShellSort\ReadMe.txt
ShellSort\ShellSort.dsw
ShellSort\ShellSort.ncb
ShellSort\ShellSort.plg
ShellSort\ShellSort.dsp
ShellSort\SqList.h
希尔排序.doc