How can I reduce the time complexity of this problem from O(n^2), can you please suggest me some approach ?
How to reduce time complexity?
@bhavik911,
Suggested Approach:
1.First sort the given array.
2.Now take two variables one as left and other as right starting from 0th and end index of the sorted array respectively.
3.Now iterate till left<right.
3.1 Calculate the sum of the elements at left and right position
3.1.1 If the sum is equal to the target then print both the elements. //printing target sum pairs
3.1.2 If the sum is less than the target then increase the left by 1
3.1.3 Else decrease the right by 1
Thanks for the approach, appreciate it 