Bird
Raised Fist0
NumPydata~10 mins

np.searchsorted() for insertion points in NumPy - Step-by-Step Execution

Choose your learning style10 modes available

Start learning this pattern below

Jump into concepts and practice - no test required

or
Recommended
Test this pattern10 questions across easy, medium, and hard to know if this pattern is strong
Concept Flow - np.searchsorted() for insertion points
Start with sorted array
↓
Choose value to insert
↓
np.searchsorted() finds index
↓
Return insertion index
↓
Use index to insert value without breaking order
np.searchsorted() finds the position where a value should be inserted in a sorted array to keep it sorted.
Execution Sample
NumPy
import numpy as np
arr = np.array([10, 20, 30, 40])
idx = np.searchsorted(arr, 25)
print(idx)
Finds the index where 25 should be inserted in the sorted array [10,20,30,40].
Execution Table
StepArrayValue to InsertSearch DirectionIndex FoundExplanation
1[10, 20, 30, 40]25left (default)225 fits between 20 (index 1) and 30 (index 2)
2[10, 20, 30, 40]5left (default)05 is less than 10, insert at start
3[10, 20, 30, 40]40left (default)340 equals element at index 3, insert before it
4[10, 20, 30, 40]40right4With side='right', insert after existing 40
5[10, 20, 30, 40]50left (default)450 is greater than all, insert at end
💡 All insert positions found to keep array sorted.
Variable Tracker
VariableStartAfter Step 1After Step 2After Step 3After Step 4After Step 5
arr[10, 20, 30, 40][10, 20, 30, 40][10, 20, 30, 40][10, 20, 30, 40][10, 20, 30, 40][10, 20, 30, 40]
valueN/A255404050
sideleft (default)leftleftleftrightleft
indexN/A20344
Key Moments - 3 Insights
Why does np.searchsorted return 3 for value 40 with default side='left'?
Because side='left' means insert before existing equal values. Since 40 is at index 3, insertion index is 3 (see execution_table row 3).
What changes when side='right' is used for value 40?
With side='right', insertion happens after existing equal values. So for 40, index is 4 (see execution_table row 4).
Why is the insertion index 0 for value 5?
Because 5 is smaller than all elements, it should be inserted at the start (index 0), keeping array sorted (see execution_table row 2).
Visual Quiz - 3 Questions
Test your understanding
Look at the execution_table row 1. What index does np.searchsorted return for inserting 25?
A1
B2
C3
D0
💡 Hint
Check the 'Index Found' column in row 1 of execution_table.
At which step does np.searchsorted return the insertion index at the end of the array?
AStep 5
BStep 3
CStep 2
DStep 4
💡 Hint
Look for the largest index equal to array length in 'Index Found' column.
If side='right' is used for value 40, what insertion index is returned?
A3
B2
C4
D1
💡 Hint
Check execution_table row 4 for side='right' insertion index.
Concept Snapshot
np.searchsorted(sorted_array, value, side='left')
- Finds index to insert value in sorted_array
- side='left' inserts before equal values
- side='right' inserts after equal values
- Keeps array sorted after insertion
- Returns integer index for insertion
Full Transcript
np.searchsorted() helps find where to insert a value in a sorted array so the order stays correct. It takes a sorted array and a value to insert. By default, it finds the leftmost place to insert the value, meaning before any equal values. You can change this with the side parameter to 'right' to insert after equal values. The function returns the index where the value should go. For example, in [10, 20, 30, 40], inserting 25 returns index 2 because 25 fits between 20 and 30. Inserting 40 with side='left' returns 3, before the existing 40. With side='right', it returns 4, after the existing 40. This helps keep arrays sorted when adding new elements.

Practice

(1/5)
1. What does the np.searchsorted() function do in NumPy?
easy
A. Returns the maximum value in the array
B. Sorts the array in ascending order
C. Removes duplicate values from the array
D. Finds the index where a value should be inserted to keep the array sorted

Solution

  1. Step 1: Understand the purpose of np.searchsorted()

    This function finds the position where a new element can be inserted in a sorted array without breaking the order.
  2. Step 2: Compare with other options

    Options B, C, and D describe different functions: sorting, removing duplicates, and finding max, which are not what searchsorted does.
  3. Final Answer:

    Finds the index where a value should be inserted to keep the array sorted -> Option D
  4. Quick Check:

    Insertion index finder = A [OK]
Hint: Remember: searchsorted finds insert position, not sorting [OK]
Common Mistakes:
  • Confusing searchsorted with sorting functions
  • Thinking it removes duplicates
  • Assuming it returns values instead of indices
2. Which of the following is the correct syntax to find the insertion index of value 5 in a sorted array arr using np.searchsorted()?
easy
A. np.searchsorted(arr, value=5)
B. np.searchsorted(arr, 5)
C. arr.searchsorted(5)
D. np.searchsorted(5, arr)

Solution

  1. Step 1: Recall the function signature

    The correct syntax is np.searchsorted(array, value), so the array comes first, then the value.
  2. Step 2: Check each option

    np.searchsorted(arr, 5) matches the correct order. np.searchsorted(5, arr) reverses arguments. arr.searchsorted(5) is invalid because searchsorted is not a method of ndarray. np.searchsorted(arr, value=5) uses a wrong keyword argument.
  3. Final Answer:

    np.searchsorted(arr, 5) -> Option B
  4. Quick Check:

    Array first, value second = D [OK]
Hint: Remember: np.searchsorted(array, value) order [OK]
Common Mistakes:
  • Swapping the order of arguments
  • Using searchsorted as a method of array
  • Using incorrect keyword arguments
3. What is the output of the following code?
import numpy as np
arr = np.array([1, 3, 5, 7])
index = np.searchsorted(arr, 4)
print(index)
medium
A. 2
B. 1
C. 3
D. 4

Solution

  1. Step 1: Understand the array and value

    The array is [1, 3, 5, 7], and we want to insert 4 while keeping it sorted.
  2. Step 2: Find the insertion index

    4 fits between 3 (index 1) and 5 (index 2), so the insertion index is 2.
  3. Final Answer:

    2 -> Option A
  4. Quick Check:

    Insert 4 between 3 and 5 = 2 [OK]
Hint: Find where value fits between sorted elements [OK]
Common Mistakes:
  • Choosing index of smaller element
  • Choosing index of larger element
  • Confusing zero-based indexing
4. The code below throws an error. What is the mistake?
import numpy as np
arr = np.array([2, 4, 6, 8])
index = np.searchsorted(arr, side='left', 5)
print(index)
medium
A. The 'side' argument should come after the value argument
B. The array must be sorted in descending order
C. The function does not accept keyword arguments
D. The value to insert must be an array, not a scalar

Solution

  1. Step 1: Check function argument order

    np.searchsorted expects the array first, then the value, then optional keywords like side.
  2. Step 2: Identify the error in argument placement

    The code passes side='left' before the value 5, which is incorrect syntax.
  3. Final Answer:

    The 'side' argument should come after the value argument -> Option A
  4. Quick Check:

    Keyword args after positional args = A [OK]
Hint: Put keyword arguments after positional ones [OK]
Common Mistakes:
  • Placing keyword arguments before positional arguments
  • Assuming array must be descending
  • Thinking scalar values are invalid
5. Given a sorted array arr = np.array([1, 2, 2, 3, 4]), which code snippet will insert the value 2 after all existing 2s using np.searchsorted()?
hard
A. index = np.searchsorted(arr, 2)
B. index = np.searchsorted(arr, 2, side='left')
C. index = np.searchsorted(arr, 2, side='right')
D. index = np.searchsorted(arr, 2, side='both')

Solution

  1. Step 1: Understand the side parameter

    side='right' returns the insertion index after existing equal values; side='left' inserts before.
  2. Step 2: Apply to the array

    For value 2 in [1, 2, 2, 3, 4], side='right' gives index 3, after the two 2s.
  3. Final Answer:

    index = np.searchsorted(arr, 2, side='right') -> Option C
  4. Quick Check:

    Insert after equals = side='right' = C [OK]
Hint: Use side='right' to insert after equal values [OK]
Common Mistakes:
  • Using side='left' inserts before equal values
  • Assuming default side inserts after equals
  • Using invalid side='both'