Binary search divides list in 2 part, Can we achieve higher speeds by dividing into more parts?

by dividing the linear 2D array into multiple part of different ranges.

For example, sorted array [1,2,3,4,5,6,7,8,9] can be divided into 3 parts or different ranges like…

[1,3)+ [3,6) + [6,9]

And the condition function will check 3 conditions and then returns that in which part of the array the Trinity search should look for.