Description: Description:
The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the location, and the array after the changes.
Note: The array of integers, an array of key code storage location r [1] ~ r [n], r [0] reserved for its use, and the key number is greater than 4 yards.
Input Format:
The first line in the input array records the number of n
The second line, type n-ordered integer key code, separated by a space
Next, enter the three complete set of key codes, key codes for each accounting l
To Search:
File list (Check if you may need any files):
main.txt
....\main.cpp
....\main.dsp
....\main.dsw
....\main.plg
main
....\main.ncb
....\main.opt
Download