Description: Hill sorting algorithm: the basic idea: the whole sequence disorder is separated into a number of small sub-sequences respectively Insertion Sort. Sequence segmentation method: h will be separated by an incremental elements constitute a subset of sequences. In the sort process, the successive decrease of the increment, and finally reduced to one when h when an insertion sort, sort completed. Incremental sequence generally use: ht = 2t-1, 1 ≤ t ≤ [log2n], in which n is the length of sequence to be sorted.
To Search:
- [OBJECT] - This is a procedure had been tested, the
- [RFID_6xis] - Hardware can capture the value of three-
- [bpnet2] - The use of
File list (Check if you may need any files):
Download