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.

2fenfa.doc

• 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．