Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- def b_search(element, arr)
- min = 0
- max = (arr.size) -1
- while min <= max do
- med = min + (max - min) / 2
- if arr[med] > element
- max = med -1
- elsif arr[med] < element
- min = med + 1
- else
- return true
- end
- end
- false
- end
- def pairs(k, arr)
- count = 0
- arr.sort!
- size = arr.size - 1
- for i in (0..size)
- element = arr[i]+k
- if b_search(element, arr)
- count += 1
- end
- end
- count
- end
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement