文件名称:2fenfa
介绍说明－－下载内容均来自于网络，请自行研究使用
算法思想简单描述：
在插入第i个元素时，对前面的0～i-1元素进行折半，先跟他们中间的那个元素比，如果小，则对前半再进行折半，否则对后半进行折半，直到left>right，然后再把第i个元素前1位与目标位置之间的所有元素后移，再把第i个元素放在目标位置上。
-The algorithm ideas brief descr iption: 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.
在插入第i个元素时，对前面的0～i-1元素进行折半，先跟他们中间的那个元素比，如果小，则对前半再进行折半，否则对后半进行折半，直到left>right，然后再把第i个元素前1位与目标位置之间的所有元素后移，再把第i个元素放在目标位置上。
-The algorithm ideas brief descr iption: 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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
2fenfa.doc