When bisecting an array, there is typically a condition that the array is not updated. Not being updated is a sufficient but not a necessary condition. There is a use case for updating and dichotomous search.

  • LAM
  • Update to x, the largest value that does not exceed x.”
  • This keeps it sorted.

This page is auto-translated from /nishio/ζ›΄ζ–°γ•γ‚ŒδΊŒεˆ†ζŽ’η΄’γ§γγ‚‹ι…εˆ— using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.