Largest and Smallest Number in an Array using Recursion Quiz Online Practice Test

1. Which techniques can be employed to identify both the largest and smallest elements in an array?

2. Given the following iterative code snippet to find the largest element:

int get_max_element(int *arr, int n)
{
int i, max_element = arr[0];
for(i = 1; i < n; i++)
if(________)
max_element = arr[i];
return max_element;
}
Which line should be inserted to complete this function?

3. Examine the following code snippet designed to find the smallest element in an array:

int get_min_element(int *arr, int n)
{
int i, min_element = arr[0];
for(i = 1; i < n; i++)
if(_______)
min_element = arr[i];
return min_element;
}
Which line of code should be inserted to complete this function?

4. What will be the output of the following program?

#include<stdio.h>
int get_max_element(int *arr, int n)
{
int i, max_element = arr[0];
for(i = 1; i < n; i++)
if(arr[i] > max_element)
max_element = arr[i];
return max_element;
}
int get_min_element(int *arr, int n)
{
int i, min_element = arr[0];
for(i = 1; i < n; i++)
if(arr[i] < min_element)
min_element = arr[i];
return min_element;
}
int main()
{
int n = 7, arr[7] = {5, 2, 4, 7, 8, 1, 3};
int max_element = get_max_element(arr, n);
int min_element = get_min_element(arr, n);
printf("%d %d", max_element, min_element);
return 0;
}

5. What will the following code output?

#include<stdio.h>
int get_max_element(int *arr, int n)
{
int i, max_element = arr[0];
for(i = 1; i < n; i++)
if(arr[i] > max_element)
max_element = arr[i];
return max_element;
}
int get_min_element(int *arr, int n)
{
int i, min_element;
for(i = 1; i < n; i++)
if(arr[i] < min_element)
min_element = arr[i];
return min_element;
}
int main()
{
int n = 7, arr[7] = {1, 1, 1, 0, -1, -1, -1};
int max_element = get_max_element(arr, n);
int min_element = get_min_element(arr, n);
printf("%d %d", max_element, min_element);
return 0;
}

6. What is the time complexity of the following code that finds both the largest and smallest elements in an array?

#include<stdio.h>
int get_max_element(int *arr, int n)
{
int i, max_element = arr[0];
for(i = 1; i < n; i++)
if(arr[i] > max_element)
max_element = arr[i];
return max_element;
}
int get_min_element(int *arr, int n)
{
int i, min_element;
for(i = 1; i < n; i++)
if(arr[i] < min_element)
min_element = arr[i];
return min_element;
}
int main()
{
int n = 7, arr[7] = {1, 1, 1, 0, -1, -1, -1};
int max_element = get_max_element(arr, n);
int min_element = get_min_element(arr, n);
printf("%d %d", max_element, min_element);
return 0;
}

7. Given the recursive function to find the largest element in an array:

int max_of_two(int a, int b)
{
if(a > b)
return a;
return b;
}
int recursive_max_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return _______;
}
Which line should be added to complete this function?

8. What will be the output of the following program?

#include<stdio.h>
int max_of_two(int a, int b)
{
if(a > b)
return a;
return b;
}
int min_of_two(int a, int b)
{
if(a < b)
return a;
return b;
}
int recursive_max_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return max_of_two(arr[idx], recursive_max_element(arr, len, idx + 1));
}
int recursive_min_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return min_of_two(arr[idx], recursive_min_element(arr, len, idx + 1));
}
int main()
{
int n = 10, idx = 0, arr[] = {5, 2, 6, 7, 8, 9, 3, -1, 1, 10};
int max_element = recursive_max_element(arr, n, idx);
int min_element = recursive_min_element(arr, n, idx);
printf("%d %d", max_element, min_element);
return 0;
}

9. Determine the time complexity of the following recursive code used to find the largest and smallest elements in an array:

#include<stdio.h>
int max_of_two(int a, int b)
{
if(a > b)
return a;
return b;
}
int min_of_two(int a, int b)
{
if(a < b)
return a;
return b;
}
int recursive_max_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return max_of_two(arr[idx], recursive_max_element(arr, len, idx + 1));
}
int recursive_min_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return min_of_two(arr[idx], recursive_min_element(arr, len, idx + 1));
}
int main()
{
int n = 10, idx = 0, arr[] = {5, 2, 6, 7, 8, 9, 3, -1, 1, 10};
int max_element = recursive_max_element(arr, n, idx);
int min_element = recursive_min_element(arr, n, idx);
printf("%d %d", max_element, min_element);
return 0;
}

10. How many times does the function recursive_min_element() execute in the following code?

int min_of_two(int a, int b)
{
if(a < b)
return a;
return b;
}
int recursive_min_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return min_of_two(arr[idx], recursive_min_element(arr, len, idx + 1));
}
int main()
{
int n = 10, idx = 0, arr[] = {5, 2, 6, 7, 8, 9, 3, -1, 1, 10};
int min_element = recursive_min_element(arr, n, idx);
printf("%d", min_element);
return 0;
}