Data Structure:
 How many comparisons are necessary to find the largest and smallest of a set of n distinct elements?
 


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

Post New Answer

More Programming Languages AllOther Interview Questions

how to fin top two miximum values in sql? not 2nd both max value of 1st and 2nd both have to find out

0 Answers  


Definition of Singleton Class? what is the Purpose of it? what is the advantage?

0 Answers   Cognizant,


Wats the name of the first os

2 Answers  


What does this useful command line do? tasklist /m "mscor*"

1 Answers  


what is encapulation?

4 Answers   Syntel,






Plz sent me in .net 2.0 interview Question & answers?

0 Answers  


how to work search engine? plz detail answer me.

0 Answers  


Can i please VHDL code for D-Latch with clear input ?? (HINT: Set up a “Process” with appropriate sensitivity list to get the desired D-Latch with Clr working.) Inputs and Outputs: entity Lab4b is Port ( Clr, Clk, D : in STD_LOGIC; Q : out STD_LOGIC); end Lab4b;

0 Answers  


Define Form modules, Class modules and Standard modules

0 Answers   Global Hunt,


Artficial language is provided which of the language?

3 Answers   Geometric Software,


Is buffer size and file block size is similar? If similar,at which case it will be same size?

0 Answers  


what is software

2 Answers  


Categories