- Category:
- Data structs
- Tags:
-
[WORD]
- File Size:
- 5kb
- Update:
- 2013-01-04
- Downloads:
- 0 Times
- Uploaded by:
- 李先生
Description: The algorithm ideas brief description: 0 ~ i-1 of the preceding element in the i-th element is inserted, binary, begin their middle of the element ratio, if small, the first half and then a binary, otherwise the latter half binary until left> right, then put the i-th element with all the elements between the target position after a shift, then the i-th element is placed in the target position.
To Search:
File list (Check if you may need any files):
2fenfa.doc
Download