sir why do you subtract 1 from lower bound?
Money change problem
As we have changed our comparator function so that it works like upper bound. So it will always return index of that element whose value is greater than the needed value and to get the required value , we need to do -1.
Suppose, If we dont use comparator, then the lower bound function gives the first value in the sorted array that is greater than or equal to the value to be found i.e it will ignore all values smaller than the value to be found. But, when we define a comparator same as defined in the lecture, the lower bound function ignores all the value smaller than or equal to the value to be found and hence will always return the index of key which has value greater than the value to be found. Hence we will have to subtract 1 from index in order to get the index of key which has value smaller than or equal to the required value.
By using a<=b, comparator function returns true for all elements <= value to be found. When the comparator function returns false at that time we see that the current index might be the answer. If we dont use comparator function, it returns true only for elements < value to be found.
sir thanks a lot, now I got it.
but I have just understood how the comparators work?
but how do you know in the comparator parameters that (b) is the value and (a) is the elements in the array not vice versa!!
with all respect