search in an array between two values

[nept]

I have an 2d array of about 100000 sorted elements in the first index, I need to derive the subarray whose values are included between a lower and upper bounds (not the array index, but the value contained in them). The element-by-element comparison is too slow. How can I do?

[Yamaeda · Accepted solution]

If the limits exist in the array you can use "Search ordered array" (or Search 1D array) for them and then use those indeces with a Array Subset. If the limits are arbitrary you'll need to use Threshold array.

[nept]

thanks!

[altenbach]

"Threshold 1D array " can efficiently search a nondescending array and you can round up or down to the next integer to either include or exclude the boundaries. I would recommend that instead.

(for the second limit you can even change the start index).

[altenbach]

---

@altenbach wrote:

"Threshold 1D array " can efficiently search a nondescending array

---

Here's what I had in mind: