文件名称:medi
介绍说明－－下载内容来自于网络，使用问题请自行百度
设X[0:n-1]和Y[0:n-1]为2 个数组,每个数组中含有n 个已排好序的数。试设计一个
O(log n)时间的算法,找出X 和Y 的2n 个数的中位数。-Let X [0: n-1] and Y [0: n-1] for the two arrays, each array containing the n number has been sorted. Try to design an O (log n) time algorithm to find the X and Y 2n median number.
O(log n)时间的算法,找出X 和Y 的2n 个数的中位数。-Let X [0: n-1] and Y [0: n-1] for the two arrays, each array containing the n number has been sorted. Try to design an O (log n) time algorithm to find the X and Y 2n median number.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
medi/medi.pdf
medi/medi.txt
medi/medi111.cpp
medi/
medi/medi.txt
medi/medi111.cpp
medi/
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.