searchsorted
tells you where the element belongs to guarantee ordering:
Find the indices into a sorted array a such that, if the corresponding elements in v were inserted before the indices, the order of a would be preserved.
inserting 740
at position 7 would preserve ordering, as would inserting 0 at position 0.