unordered_set count() function in C++ STL

Count smaller elements in sorted array in C++

Last Updated : 30 Mar, 2018

Given a sorted array and a number x, count smaller elements than x in the given array. Examples:

Input : arr[] = {10, 20, 30, 40, 50}
            x = 45
Output : 4
There are 4 elements smaller than 45.

Input : arr[] = {10, 20, 30, 40, 50}
            x = 40
Output : 3
There are 3 elements smaller than 40.

We can use upper_bound() in C++ to quickly find the result. It returns iterator (or pointer) to first element which is greater than given number. If all elements smaller, then it returns size of array. If all elements are greater than it returns 0.

CPP

// CPP program to count smaller elements
// in an array.
#include <bits/stdc++.h>
using namespace std;

int countSmaller(int arr[], int n, int x)
{
   return upper_bound(arr, arr+n, x) - arr;
}

// Driver code
int main()
{
    int arr[] = { 10, 20, 30, 40, 50 };
    int n = sizeof(arr)/sizeof(arr[0]);
    cout << countSmaller(arr, n, 45) << endl; 
    cout << countSmaller(arr, n, 55) << endl;
    cout << countSmaller(arr, n, 4) << endl;
    return 0;
}

Output:

4
5
0

Time Complexity : O(Log n)

unordered_set count() function in C++ STL

kartik

Improve

Article Tags :

C++

Practice Tags :

CPP

Similar Reads

unordered_set count() function in C++ STL

The unordered_set::count() function is a built-in function in C++ STL which is used to count occurrences of a particular element in an unordered_set container. As the unordered_set container does not allows to store duplicate elements so this function is generally used to check if an element is pres

unordered_multiset count() function in C++ STL

The unordered_multiset::count() is a built-in function in C++ STL which returns the count of elements in the unordered_multiset container which is equal to a given value. Syntax: unordered_multiset_name.count(val) Parameters: The function accepts a single mandatory parameter val which specifies the

multiset count() function in C++ STL

The multiset::count() function is a built-in function in C++ STL that searches for a specific element in the multiset container and returns the number of occurrences of that element. Syntax: multiset_name.count(val) Parameters: The function accepts a single parameter val which specifies the element

Remove duplicates from a sorted array using STL in C++

Given a sorted array, the task is to remove the duplicate elements from the array using STL in C++ Examples: Input: arr[] = {2, 2, 2, 2, 2} Output: arr[] = {2} Input: arr[] = {1, 2, 2, 3, 4, 4, 4, 5, 5} Output: arr[] = {1, 2, 3, 4, 5} Approach: The duplicates of the array can be removed using the un

Get first and last elements from Array and Vector in CPP

Given an array, find first and last elements of it. Input: {4, 5, 7, 13, 25, 65, 98} Output: First element: 4 Last element: 98 In C++, we can use sizeof operator to find number of elements in an array. CPP // C++ Program to print first and last element in an array #include <iostream> using nam

array::size() in C++ STL

The array::size() method is used to find the number of elements in the array container. It is the member method std::array class defined inside <array> header file. In this article, we will learn about the array::size() method in C++.Example:C++// C++ Program to illustrate the use of array::si

C++ Program to Count Positive and Negative Numbers in an Array

Given an array arr of integers of the size of N, our task is to find the count of positive numbers and negative numbers in the array. Examples: Input: arr[] = [-9,7,-5,3,2]Output: Positive elements = 3, Negative elements = 2 Input: arr[] = [5,4,-2,-1,-7]Output: Positive elements = 2, Negative elemen

How to print size of array parameter in C++?

How to compute the size of an array CPP? C++ // A C++ program to show that it is wrong toÂ // compute size of an array parameter in a function #include <iostream> using namespace std; void findSize(int arr[]) { cout << sizeof(arr) << endl; } int main() { int a[10]; cout << si

Find the Frequency of Each Element in a Vector in C++

The frequency of an element is number of times it occurred in the vector. In this article, we will learn different methods to find the frequency of each element in a vector in C++.The simplest method to find the frequency of each element in a vector is by iterating the vector and storing the count o

Create a Sorted Array Using Binary Search

Given an array, the task is to create a new sorted array in ascending order from the elements of the given array.Examples: Input : arr[] = {2, 5, 4, 9, 8} Output : 2 4 5 8 9 Input : arr[] = {10, 45, 98, 35, 45} Output : 10 35 45 45 98 The above problem can be solved efficiently using Binary Search.