numpy.searchsorted() is used to search for indices in the sorted array arr, so if elements are inserted before the indices, the order of arr will still be preserved. Here binary search is used to find the required insertion indices.
Syntax: numpy.searchsorted (arr, num, side = ’left’, sorter = None)
arr: [array_like] Input array. If sorter is None, then it must be sorted in ascending order, otherwise sorter must be an array of indices that sort it.
num: [array_like] The Values which we want to insert into arr.
side: [’left’, ’right’], optional.If ’left’, the index of the first suitable location found is given. If ’right’, return the last such index. If there is no suitable index, return either 0 or N (where N is the length of a).
num: [array_like, Optional] array of integer indices that sort array a into ascending order. They are typically the result of argsort.
Return: [indices], Array of insertion points with the same shape as num.
Code # 1: Work
Input array: [2, 3, 4, 5, 6] The number which we want to insert: 4 Output indices to maintain sorted array: 2
Code # 2:
Input array: [2, 3, 4, 5, 6] The number which we want to insert: 4 Output indices to maintain sorted array: 3
Code # 3:
Input array: [2, 3, 4, 5, 6] The number which we want to insert: [4, 8, 0] Output indices to maintain sorted array: [2 5 0]