Square root decomposition technique

general
, ,
1

what is square root decomposition technique?How it has an edge over binary search?
Could u please attach the algorithm or an example done with square root decomposition technique

2

You can understand about square root decomposition here.

It is not always true that it has edge over binary search. If we are searching in a sorted array, Time complexity of binary search is O(log(N)) whereas square root decomposition take O(N^0.5).

You can check my solution on MAXEP.