XCSme
searching PlanetScale…
- 1.▲
- 2.▲
- 3.▲
- 4.▲
- 5.▲
- 6.▲
12 ms·
- 271.▲
- 272.▲
- 273.▲
- 274.▲
- 275.▲
- 276.▲
- 277.▲
- 278.▲
- 279.▲
- 280.▲
- 281.▲
- 282.▲
- 283.▲
- 284.▲
- 285.▲
- 286.▲
- 287.▲
- 288.▲
- 289.▲
- 290.▲
- 291.▲
- 292.▲
- 293.▲
- 294.▲
- 295.▲
- 296.▲
- 297.▲
- 298.▲
- 299.▲
Is it possible to do some sort of Binary* Search (Binary Star, as in A* star search algorithm, where we use heuristics). a: [1,3,5,7,8,9,10,15]
x: 8 (query value)
For this array, we would compare a[0], a[3], a[7] (left/m - 300.▲
More ›