Change language

numpy.searchsorted () in Python

| |

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)

Parameters:
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

# Python program explaining
# Searchsorted () function

 

import numpy as geek

 
# input array

in_arr = [ 2 , 3 , 4 , 5 , 6 ]

print ( "Input array:" , in_arr)

  
# the number we want to insert

num = 4

print ( " The number which we want to insert: " , num) 

 

out_ind = geek.searchsorted (in_arr, num) 

print ( "Output indices to maintain sorted array:" , out_ind)

Output:

 Input array: [2, 3, 4, 5, 6] The number which we want to insert: 4 Output indices to maintain sorted array: 2 

Code # 2:

# Python program explaining
Function # searchsorted ()

 

import numpy as geek

 
# input array

in_arr = [ 2 , 3 , 4 , 5 , 6 ]

print ( " Input array: " , in_arr)

  
# the number we want to insert

num = 4

print ( " The number which we want to insert: " , num) 

  

out_ind = geek.searchsorted (in_arr, num , side = ’right’

print ( "Output indices to maintain sorted array:" , out_ind) < / code>

Output:

 Input array: [2, 3, 4, 5, 6] The number which we want to insert: 4 Output indices to maintain sorted array: 3 

Code # 3:

# Python program explaining
Function # searchsorted ()

 

import numpy as geek

 
# input array

in_arr = [ 2 , 3 , 4 , 5 , 6 ]

print ( " Input array: " , in_arr)

 
# the numbers we want to insert

num = [ 4 , 8 , 0 ]

print ( "The number which we want to insert:" , num) 

 

out_ind = geek.searchsorted (in_arr, num) 

print ( " Output indices to maintain sorted array: " , out_ind)

Output:

 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] 

Shop

Learn programming in R: courses

$

Best Python online courses for 2022

$

Best laptop for Fortnite

$

Best laptop for Excel

$

Best laptop for Solidworks

$

Best laptop for Roblox

$

Best computer for crypto mining

$

Best laptop for Sims 4

$

Latest questions

NUMPYNUMPY

psycopg2: insert multiple rows with one query

12 answers

NUMPYNUMPY

How to convert Nonetype to int or string?

12 answers

NUMPYNUMPY

How to specify multiple return types using type-hints

12 answers

NUMPYNUMPY

Javascript Error: IPython is not defined in JupyterLab

12 answers


Wiki

Python OpenCV | cv2.putText () method

numpy.arctan2 () in Python

Python | os.path.realpath () method

Python OpenCV | cv2.circle () method

Python OpenCV cv2.cvtColor () method

Python - Move item to the end of the list

time.perf_counter () function in Python

Check if one list is a subset of another in Python

Python os.path.join () method