std::nth_element in C++

std::nth_element() is an STL algorithm that rearranges the list in such a way such that the element at the nth position is the one which should be at that position if we sort the list.

It does not sort the list, just that all the elements, which precede the nth element are not greater than it, and all the elements which succeed it are not less than it.

It has two versions, which are defined below:

1. Comparing elements using "<":

Syntax

void nth_element (RandomAccessIterator first, RandomAccessIterator nth,
 RandomAccessIterator last);

Parameters

• first: Random-access iterator to the first element in the list.
• last: Random-access iterator to the last element in the list.
• nth: Random-access iterator pointing to the position in the list, which should be sorted.

If it points to the end, then this function will do nothing.

Return Value

• Since the return type is void, so it does not return any value.

Example

3 2 10 23 33 56 45 47 

Here, the fifth element is 33, and all elements to its left are smaller than it and all elements to its right are greater than it.

2. Comparing using a User-Defined Function

Syntax

void nth_element (RandomAccessIterator first, RandomAccessIterator nth,
 RandomAccessIterator last, Compare comp);

Here, the first, last, and nth arguments are the same as in the previous case.

• comp: Binary function that accepts two elements in the range as arguments, and returns a value convertible to bool. The value returned indicates whether the element passed as the first argument is considered to go before the second in the specific strict weak ordering it defines. The function shall not modify any of its arguments. This can either be a function pointer or a function object.

Return Value

• Since its return type is void, it does not return any value.

Example

33 2 10 23 3 45 47 56 

In this code, since the nth element as pointed out by the second argument in std::nth_element is the sixth element of the array v, so this means that the sixth element in the array after the application of std::nth_element should be the one that would have been there if the whole array was sorted, i.e., 45. And also all the elements to its left are either less than it or equal to it and the elements on its right are greater than it. Purpose of Binary Function comp: std::nth_element partially sorts the range [first, last) in ascending order so that the condition, *i < *j, (for version 1 ), or comp(*i, *j) == true (for version 2) is met for any i in the range [first, nth) and for any j in the range [nth, last). So, comp() is used to ensure that all the elements before the nth_element are less than elements after the nth_element.

Where can we apply std::nth_element()?

1. It can be used if we want to find the first n smallest numbers, but they may or maynot be ordered.

20 10 30 

2. Just like first n smallest number, we can also find first n largest numbers, by just changing the Binary Function passed as argument in std::nth_element. 

80 70 

Here, we have passed greater() as binary function, so now nth element will be the one which should be at the nth place if we sort the given array in descending order, so first n elements will be the first n largest elements.

3. It can be used to find the median of the elements given.

The median of the array is 33

Here the sorted array will be 2 3 10 23 33 45 47 56 60, so there are 9 elements and the median will be the middle element, i.e., 5th element: 33.

Time Complexity of std::nth_element(): O(n), with n being the distance between the first and the last.

Internal Implementation of std::nth_element

The std::nth_element algorithm is implemented using a hybrid approach called "Introselect." This technique combines the efficiency of both Quickselect and the Median of Medians algorithm:

1. Quickselect:
   • Quickselect is employed to find the kth smallest element in an unsorted array.
   • It is a selection algorithm based on the partitioning step of the Quick Sort algorithm.
   • Quickselect focuses on a specific partition containing the kth element, avoiding unnecessary sorting of other elements.
2. Median of Medians:
   • The Median of Medians algorithm is used to enhance the selection of a pivot element during partitioning.
   • It is primarily used in Quickselect to improve pivot selection, which affects the algorithm's performance.
   • The Median of Medians algorithm ensures a more balanced partitioning and reduces the likelihood of worst-case scenarios.

Related Articles:

• std::search
• std::find
• std::find_if, std::find_if_not
• std::find_end
• std::sort