Count the number of 1’s and 0’s in a binary array using STL in C++

In this tutorial, we will be discussing a program to count the number of 1’s and 0’s in a binary array using STL in C++.

For this we will be provided with an array. Our task is to count the number of 0’s and 1’s present in the array.

Example

 Live Demo

#include <bits/stdc++.h>
using namespace std;
// checking if element is 1 or not
bool isOne(int i){
   if (i == 1)
      return true;
   else
      return false;
}
int main(){
   int a[] = { 1, 0, 0, 1, 0, 0, 1 };
   int n = sizeof(a) / sizeof(a[0]);
   int count_of_one = count_if(a, a + n, isOne);
   cout << "1's: " << count_of_one << endl;
   cout << "0's: " << (n - count_of_one) << endl;
   return 0;
}

Output

1's: 3
0's: 4

Ayush Gupta

Published on 16-Mar-2020 09:59:56

• Related Questions & Answers
• Count subarrays with equal number of 1’s and 0’s in C++
• Count subarrays consisting of only 0’s and only 1’s in a binary array in C++
• Count number of binary strings of length N having only 0’s and 1’s in C++
• Sort an arrays of 0’s, 1’s and 2’s using C++
• 1’s and 2’s complement of a Binary Number?
• Largest number with binary representation is m 1’s and m-1 0’s in C++
• Find the Pattern of 1’s inside 0’s using C++
• Segregate 0’s and 1’s in an array list using Python?
• Sort an arrays of 0’s, 1’s and 2’s using Java
• Binary representation of next greater number with same number of 1’s and 0’s in C Program?
• Construct DFA of alternate 0’s and 1’s
• Maximum length of segments of 0’s and 1’s in C++
• Count 1’s in a sorted binary array in C++
• Maximum 0’s between two immediate 1’s in binary representation in C++
• Given a sorted array of 0’s and 1’s, find the transition point of the array in C++