※ 引述《cai7773 (蓄勢待發)》之銘言：
: Algorithm :
: Assume m >= n
: Sort array X[1:m] and Y[1:n] Time complexity = O( log m )
↖ ↗
I'd like to smoke what you were smoking... XD
: For each i = 1:m,
: Find d-X[i] in array Y using bisection method
: Time complexity = O( m*log n)
: Total Time complexity = O( m * log n)
: ※ 引述《mqazz1 (無法顯示)》之銘言：
: : given two unsorted arrays X and Y,
: : each contains m and n numbers, separately.
: : design an algorithm so that,
: : given a number d,
: : it could determine if there exists two integers i and j,
: : such that X[i] + Y[i] = d
: : use less than O(m*n) running time
: : 我想請問這題大致上從哪方面下手會比較簡易
: : 謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 65.87.177.87