sami_youssef's blog

corresponding pair
By sami_youssef, history, 11 years ago, In English

there is an algorithm less than O(Logn)

  • Vote: I like it
  • +4
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
11 years ago, hide # |
← Rev. 2  
Vote: I like it +9 Vote: I do not like it

(n-1) + (n-2) + ... + (n-r) <= i
n*r - r*(r+1)/2 <= i
The rest is up to you

→ Reply