Husen's Code

# 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 ) { …

----Naive approach----   # include < iostream > bool ifsorted ( int arr [], int size ) {     for ( int i …

Naive approach # include < iostream > // naive solution 2 times traversal of the array; int getlargest ( int …

#include <iostream> int getlargest(int arr[], int n) { int res = 0; for (int i = 1; i < n; i++) { if…