First, take an integer gap < n (the number of records to be sorted) as the interval, all records will be divided into sub-sequence gap, all distances for the gap recorded in the same sub-sequence, respectively, in each sub-sequence directly into sorting purposes. Then narrow spacing gap, for example, take the gap = gap/2 sequence described above is repeated division and sorting work, until finally take gap = 1, all records in the same sort sequence so far

ShellSort.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．