Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same.


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

Design a program which assigns values to the array temperature. The program should then display the array with appropriate column and row headings.

0 Answers  


Explain what does it mean when a pointer is used in an if statement?

0 Answers  


How can I implement a delay, or time a users response, with sub-second resolution?

0 Answers  


How to declare pointer variables?

0 Answers  


What are bitwise shift operators in c programming?

0 Answers  






Which is the memory area not included in C program? give the reason

0 Answers   IBM, TCS,


Can stdout be forced to print somewhere other than the screen?

0 Answers  


What are the c keywords?

0 Answers  


Why we write conio h in c?

0 Answers  


What is LINKED LIST? How can you access the last element in a linked list?

0 Answers   ADP,


int i[2], j; int *pi;i[0] = 1; i[1] = 5; pi = i; j = *pi + 1 + *(pi + 1)Value of j after execution of the above statements will be a) 7 b) 6 c) 4 d) pointer

0 Answers  


what is the difference between call by value and call by reference?

5 Answers   Genpact, Global Logic, Infosys,


Categories