sir to calculate the occurance of a number ite should be
upperbound-lowerbound
but sir add 1 also in it ???
Problem in lower and upper bound
yes it should be upperbound-lowerbound
it might be by mistake.
good you noticed that!.
And sir one more thing
For custom comparitor used in priority queue , when we use a<b it will sort I. Descending order
But when we write custom comparitor in sort function as a<b it will sorting in ascending order
Sir told us in the video that is the value return true then it will swap the value , it will be correct in case of priority queue , but in case of sort it will not true
???
Please help
You first two statement are correct,
functors and comparetors work in opposite manner.
Not able to understand you last lines, please explain your doubt little more,
Or you can whatsaap me or call on 8750354215
Cleared on whatsaap.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.