摘要:
Pre-definition: "median of a array"isthe right-middle-value element.if O(m+n), then Merge Sort is OK!Note: The overall run time complexity should be O(log (m+n)).Reaction: Binary-Find!Input: A[0...m-1] and B[0...n-1]Steps:get the medians "ma&mb"of array A and B;compare ma and 阅读全文
posted @ 2013-05-03 09:50
highstar88
阅读(245)
评论(0)
推荐(0)
浙公网安备 33010602011771号