Husen's Code

Count 1's in a sorted Binary Array // count 1's in a sorted Binary array # include < iostream > int Co…

Finding the Last Occurrence of the element                 Finding the Last Occurrence of the element in an given arra…

BINARY SEARCH   # include < iostream > int BinarySearch ( int arr [], int n , int x ) {     int low = 0…

# include < iostream > int findMajority ( int arr [], int n ) {     // here the code goes     int res = …

Finding leaders in an array Here I have written the Two approach one is naive approach which will take O(n^2) time com…

Moving Zeros to end in an array # include < iostream > void display ( int arr [], int n ) {     std :: cout …

Reverse an array arr[] = {a, b, c, .......}; # include < iostream > int reverse ( int arr [], int size ) { …