Given an array of n elements sorted by the absolute value, how do you find two elements a+b that add to k {1, 3, -4, 6, -8, 12} K=4 O(n)?
SupportExpert
Given an array of n elements sorted by the absolute value, how do you find two elements a+b that add to k {1, 3, -4, 6, -8, 12} K=4 O(n)?
Share