Description: Set X [0: n-1] and Y [0: n-1] for the two arrays, each array has n good order have been ranked the number and try to design a O (logn) time algorithm to find of the X and Y in the 2n-digit number.
To Search:
- [SearchMedian] - Find disordered array median, in fact, c
- [serialport] - a progress of serial port you can use it
File list (Check if you may need any files):
find_the_middle_number
......................\数组合并找中位数.doc
Download