Question

Consider the following problem. Given an array ?[1...?] of ? distinct numbers. Output the largest number, or the ???, and the second largest number, or ???2, of ?. Design an algorithm such that the number of comparisons is as small as possible.

Answer 1

Pseudo Code(Algorithm):

Array[1..N]
Initialize max=Array[1],max2=Array[2];
for( i = 3:n){
if(Array[i]>max){
max2=max;
max=Array[i];
}
else if(Array[i]>max2){
max2=Array[i];
}
}
print(max,max2)

C Programm:

/******************************************************************************

Online C Compiler.
Code, Compile, Run and Debug C program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <stdio.h>

int main()
{
int array[5] = {19, 10, 8, 17, 9};
int max,max2,n,i;
n=5;
max=array[0];
max2=array[1];
for(i=2;i<n;i++){
if(array[i]>max){
max2=max;
max=array[i];
}
else if(array[i]>max2){
max2=array[i];
}
}
printf("Max : %d Max2 : %d",max,max2);
}

Output:

Output Max:19 Max2 17

*Feel free to ask(comment) if you have any doubts or if you face any difficulties while executing the program, I will be happy to help you, please upvote if you like the solution