Partial sorting with np.partition() in NumPy - Step-by-Step Execution

Concept Flow - Partial sorting with np.partition()

Input array and k

↓

Call np.partition(arr, k)

↓

Partition array so elements < kth are left

↓

Elements >= kth are right

↓

Return reference to partitioned array (not in-place)

np.partition() rearranges the array so that the element at index k is in its sorted position, with smaller elements before it and larger after, without fully sorting.

Execution Sample

NumPy

import numpy as np
arr = np.array([7, 2, 5, 3, 9])
result = np.partition(arr, 2)
print(arr)
print(result)

This code partially sorts the array so the element at index 2 is in correct sorted position. 'result' is a new array with the partitioned result; 'arr' remains unchanged.

Execution Table

Step	Input Array	k	Partitioned Array	Explanation
1	[7, 2, 5, 3, 9]	2	[3, 2, 5, 7, 9]	np.partition places element at index 2 (5) correctly; smaller elements left, larger right (order within partitions not guaranteed)
2	[3, 2, 5, 7, 9]	2	[2, 3, 5, 7, 9]	Illustrative: further partitioning may reorder within left partition, but single np.partition call produces one such arrangement
3	[2, 3, 5, 7, 9]	2	[2, 3, 5, 7, 9]	Final output: element at index 2 is 5, smaller elements left, larger right
Exit				Partitioning complete; array partially sorted around index 2

💡 np.partition stops after placing kth element correctly; no full sort done. Does NOT modify input in-place.

Variable Tracker

Variable	Start	After Step 1	After Step 2	Final
arr	[7, 2, 5, 3, 9]	[7, 2, 5, 3, 9]	[7, 2, 5, 3, 9]	[7, 2, 5, 3, 9]
k	2	2	2	2
result	None	[3, 2, 5, 7, 9]	[2, 3, 5, 7, 9]	[2, 3, 5, 7, 9]

Key Moments - 2 Insights

Why isn't the entire array fully sorted after np.partition?

np.partition only guarantees the element at index k is in the correct sorted position; elements before and after are not fully sorted, just partitioned. See execution_table step 1 and 2.

Does np.partition change the original array or return a new one?

np.partition returns a new array with the partitioned result; the original array remains unchanged. In the example, 'arr' is unchanged and 'result' is the partitioned array. See variable_tracker.

Visual Quiz - 3 Questions

Look at the execution_table at step 1, what is the element at index 2 in the partitioned array?

A 5

B 3

C 7

D 2

💡 Hint

Check the 'Partitioned Array' column at step 1 in execution_table

At which step does the array become [2, 3, 5, 7, 9]?

A Step 1

B Step 3

C Step 2

D Exit

💡 Hint

Look at the 'Partitioned Array' column for each step in execution_table

If k was changed to 0, what would np.partition guarantee about the array?

A The largest element is at index 0

B The smallest element is at index 0

C The array is fully sorted

D No change to the array

💡 Hint

np.partition places the kth element in sorted position; k=0 means smallest element at index 0

Concept Snapshot

np.partition(array, k)
- Partially sorts array
- Element at index k is in sorted position
- Elements before k are smaller or equal
- Elements after k are larger or equal
- Does NOT fully sort the array
- Returns a new array; original unchanged

Full Transcript

np.partition takes an array and an index k. It returns a new array rearranged so that the element at position k is the same as if the array was fully sorted. Elements before k are smaller or equal, and elements after k are larger or equal. The array is not fully sorted, only partitioned around the kth element. This is useful when you want to find the kth smallest element quickly without sorting everything. The example shows an array [7, 2, 5, 3, 9] partitioned at k=2. The output array has the element 5 at index 2, with smaller elements on the left and larger on the right. The order inside partitions is not guaranteed. np.partition does NOT modify the input array in-place; it returns a new array.

Practice

1. What does np.partition do to an array?

easy

A. It rearranges the array so the kth element is in its sorted position, with partial order around it.

B. It fully sorts the entire array in ascending order.

C. It reverses the array elements.

D. It removes duplicate elements from the array.

Solution

1. Step 1: Understand np.partition behavior

   np.partition places the kth smallest element in its correct sorted position.

2. Step 2: Recognize partial ordering

   Elements before the kth are smaller or equal, and elements after are larger or equal, but not fully sorted.

3. Final Answer:

   It rearranges the array so the kth element is in its sorted position, with partial order around it. -> Option A

4. Quick Check:

   Partial sorting = kth element fixed [OK]

Hint: Remember: np.partition fixes kth element only [OK]

Common Mistakes:

• Thinking np.partition fully sorts the array
• Assuming it reverses or removes duplicates
• Confusing np.partition with np.sort

2. Which of the following is the correct syntax to partition array arr at index 3 using np.partition?

easy

A. np.partition(arr, 3)

B. np.partition(3, arr)

C. arr.partition(3)

D. np.partition(arr, k=3)

Solution

1. Step 1: Check np.partition function signature

   The function is called as np.partition(array, kth), where kth is the index.

2. Step 2: Match syntax with options

   np.partition(arr, 3) matches the correct order: array first, then kth index.

3. Final Answer:

   np.partition(arr, 3) -> Option A

4. Quick Check:

   np.partition(array, kth) syntax [OK]

Hint: Remember: array first, kth second in np.partition() [OK]

Common Mistakes:

• Swapping arguments order
• Using method call on array (arr.partition)
• Using incorrect keyword argument like k=3

3. What is the output of the following code?

import numpy as np
arr = np.array([7, 2, 5, 3, 9])
result = np.partition(arr, 2)
print(arr)

medium

A. [2 3 5 7 9]

B. [7 2 5 3 9]

C. [2 3 5 7 9] sorted

D. [5 2 3 7 9]

Solution

1. Step 1: Identify kth element and partial sorting

   kth=2 means the element at index 2 in sorted order is placed correctly. The 3rd smallest element is 5.

2. Step 2: Rearrange array with partial order

   Elements before index 2 are smaller or equal to 5, after are larger or equal. The output is [7 2 5 3 9] because np.partition returns a new array and does not modify arr in place.

3. Final Answer:

   [7 2 5 3 9] -> Option B

4. Quick Check:

   np.partition returns a new array, original unchanged [OK]

Hint: Check kth element position, others partially ordered [OK]

Common Mistakes:

• Expecting fully sorted output
• Confusing kth index with value
• Ignoring partial order after kth

4. The code below throws an error. What is the mistake?

import numpy as np
arr = np.array([4, 1, 6, 8])
result = np.partition(arr, '2')
print(result)

medium

A. The array must be sorted before partitioning.

B. np.partition does not accept arrays as input.

C. np.partition requires a keyword argument kth=2.

D. The kth argument should be an integer, not a string.

Solution

1. Step 1: Check argument types for np.partition

   The kth argument must be an integer index, not a string.

2. Step 2: Identify error cause

   Passing '2' (string) causes a TypeError; correct is integer 2.

3. Final Answer:

   The kth argument should be an integer, not a string. -> Option D

4. Quick Check:

   kth must be int, not str [OK]

Hint: kth index must be int, not string [OK]

Common Mistakes:

• Passing kth as string instead of int
• Thinking array must be sorted first
• Using keyword argument kth which is invalid

5. You have a large dataset array data with 1 million numbers. You want to quickly find the 1000 smallest values without fully sorting. Which code snippet using np.partition is best?

hard

A. np.partition(data, 1000)[:1000]

B. np.sort(data)[:1000]

C. np.partition(data, 999)[:1000]

D. np.partition(data, -1000)[-1000:]

Solution

1. Step 1: Understand kth index for 1000 smallest

   Indices start at 0, so the 1000th smallest is at index 999.

2. Step 2: Use np.partition to get partial sorted array

   Partition at 999 puts 1000 smallest elements before index 999, so slicing [:1000] gets them.

3. Step 3: Check other options

   np.partition(data, 1000)[:1000] partitions at 1000 (off by one), C fully sorts (slow), D uses negative index (wrong for smallest).

4. Final Answer:

   np.partition(data, 999)[:1000] -> Option C

5. Quick Check:

   kth=999 for 1000 smallest [OK]

Hint: Use kth = count-1 for smallest elements [OK]

Common Mistakes:

• Using kth = 1000 instead of 999
• Using full sort instead of partition
• Using negative kth for smallest values