Asked to write code of Factorial, 2nd highest in the array

Question

Accepted Answer

Factorial function in cpp using recurssion

int factorial(int n) {

if (n == 0 || n == 1) {

return 1;

}

return n * factorial(n - 1);

}

Second highest in array

int findSecondHighest(int *arr, int n) {

if (n < 2) {

return -1;

}

int max = INT_MIN;

int secondMax = INT_MIN;

for (int i = 0; i < n; i++) {

if (arr[i] > max) {

secondMax = max;

max = arr[i];

} else if (arr[i] > secondMax && arr[i] < max) {

secondMax = arr[i];

}

return secondMax;

}

Accepted Answer

//1. Factorial

//Using for loop

int fact(int n)

{

int ans=1;

for(int i=0;i<=n;i++)

{

ans*=i;

}

return ans;

}

//Using while loop

int fact(int n)

{

int ans=1;

int i=1;

while(i<=n)

{

ans*=i;

i++;

}

return ans;

}

//Using recursion

int fact(int n)

{

if(n==1)return 1;

return n*fact(n-1);

}

//2. Second highest in array

int second_max(int arr[])

{

int mx1=arr[0];

int mx2=arr[1];

if(mx1 < mx2)swap(mx1,mx2);

for(int i=2;i

{

if(mx2

{

mx2=arr[i];

if(mx1 < mx2)swap(mx1,mx2);

}

return mx2;

}