• Perform a bisect on a sorted list and locate the insertion point for a value in arr to maintain sorted order.

    Parameters

    • arr: number[]

      array of sorted numbers

    • value: number

      value to find insertion point for

    • lo: number = 0

      used to specify a the low end of a subset of the list

    • hi: number = arr.length

      used to specify a the high end of a subset of the list

    Returns number