Husen's Code

----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…

Check for k th bit; I have solved the problem in two ways  1] Using left shift operator (<<); 2] Using right shif…

Computing Power in c++ powerof(x , n) This function takes log(n) time and auxilury space is big O 1; #include <ios…

Printing divisor in c++ I wrote the program to print all the divisors of a number... #include <iostream> #includ…

Prime factors using c++   #include <iostream> #include <cmath> int primefactors ( int num ){     if ( nu…