C Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
algorithm of linear search
2 Articles
2
Linear Search – searching and sorting – algorithm -A simple approach is to do linear search, Start from the leftmost element of arr[] and one by one compare