Breaking News: Grepper is joining You.com. Read the official announcement!

Count 1’s in sorted Binary Array.

Golu Rawat answered on July 29, 2022 Popularity 6/10 Helpfulness 6/10

answer Count 1’s in sorted Binary Array.

related c++ count 1s in binary sorted array

Count 1’s in sorted Binary Array.

Comment

/*package whatever //do not write package name here */
import java.io.*;
  
class GFG 
{
      
static int countOnes(int arr[], int n)
{
    int ans;
    int low = 0, high = n - 1;
    while (low <= high) { // get the middle index
        int mid = (low + high) / 2;
   
        // else recur for left side
        if (arr[mid] < 1)
            high = mid - 1;
        
        // If element is not last 1, recur for right side
        else if (arr[mid] > 1)
            low = mid + 1;
        else
            
        // check if the element at middle index is last 1
        {
            if (mid == n - 1 || arr[mid + 1] != 1)
                return mid + 1;
            else
                low = mid + 1;
        }
    }
    return 0;
}
      
  // Driver code
    public static void main (String[] args) {
          
        int arr[] = { 1, 1, 1, 1, 0, 0, 0 };
        int n = arr.length;
          
        System.out.println("Count of 1's in given array is "+ countOnes(arr, n));
    }
}
  
// This code is contributed by patel2127.

Popularity 6/10 Helpfulness 6/10 Language whatever

Source: www.geeksforgeeks.org

Tags: binary count whatever

Link to this answer
Share Copy Link

Contributed on Aug 24 2022

Golu Rawat

0 Answers Avg Quality 2/10

Closely Related Answers

c++ count 1s in binary sorted array

Comment

// count 1s in a binary sorted array.


#include<bits/stdc++.h>
using namespace std;
int onesINbinary(int a[],int n,int x)
{
	int l=0,h=n-1;
	while(l<=h)
	{
		int mid=(l+h)/2;
		if(a[mid]<x) l=mid+1;
		else if(a[mid]>x) h=mid-1;
		else
		{
			if(mid==0 || a[mid-1]==0) return n-mid;
			else h=mid-1;
		}
	}
	return -1;
}
int main()
{
	int n;
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++) cin>>a[i];
	int x;
	cin>>x;
	cout<<onesINbinary(a,n,x)<<endl;
	return 0;
}

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: binary count c++

Link to this answer
Share Copy Link

Contributed on Jul 29 2022

ROCKETMAN

0 Answers Avg Quality 2/10

Count 1’s in sorted Binary Array.

Contents

More Related Answers

Count 1’s in sorted Binary Array.

Closely Related Answers

c++ count 1s in binary sorted array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.