What is the problem in this code?

#1


and what is binary search space ??

#2

Hey binary search is always applies on sorted array. Here given input array is not sorted, so sort it first. Also in your answer() function you have to take take difference between current array element and previously used index not adjacent index (a[i]-a[i-1] is wrong).

Time complexity of your code is O(nlogn) and space complexity is O(n).

#3

by my mistke i am not able to give the rating?? can i give it again??