Description: Insertion Sort:
Including direct insertion sort, Hill insertion sort.
Direct insertion sort: a record inserted into the already sorted the good and orderly table.
1 0th position in the sorted array is not the playback data.
2, starting from the sorted data processing:
If the data to be smaller than its preceding data, Description the data to Wang Qianmian mobile.
First backup the data sorted into the 0 position when the sentry.
The data in front of the data after the shift.
Then forward search to find the insertion position.
Find the insertion position stresses that the 0 position data into the corresponding position.
O (n* n), to be ranked record a sequence of positive sequence, the time complexity up to O (n).
Hill sorting (narrow incremental sort of diminishing increment sort): to be ranked first copy the entire record sequence is divided into a number of sub-sequences,
To Search:
File list (Check if you may need any files):
insert.java
Download