Add support for linear range search

[mustafasrepo]

Is your feature request related to a problem or challenge? Please describe what you are trying to do.

During range calculation for window frames, we can use linear search instead of bisect. Since we know that table, is already sorted and we would progress only in one direction; linear search is amortized constant (When window frame boundaries are static e.g in the form RANGE BETWEEN 3 PRECEDING AND 5 FOLLOWING). Hence this version is more optimal than current bisect implementation (where search complexity is log(n)). This change decreases overall window range calculation complexity from O(n*log(n)) to O(n).
This reasoning is explained more thoroughly in the following paper.
https://dl.acm.org/doi/10.14778/2794367.2794375
p1058-leis.pdf

Describe the solution you'd like
Range calculation can use linear search instead of bisect. This will possibly improve performance.

Describe alternatives you've considered
N.A

Additional context
N.A

[alamb]

Somewhat related to #4904