Would you rather wait for quicksort, linear search, or bubble sort on a 200000 element array? (Or go to lunch...)

a) Quicksort

b) Linear Search

c) Bubble Sort


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

Post New Answer

More C++ General Interview Questions

What is the difference between strcpy() and strncpy()?

0 Answers  


What is the oldest programming language?

0 Answers  


What is array in c++ example?

0 Answers  


if int1 has the value 12, int has the value 18, and int3 has the value 21, what is the result: int1 < int2 && int2 < int 3

3 Answers  


What are virtual constructors/destructors?

0 Answers  






How to avoid a class from instantiation?

8 Answers   Symphony,


Is c the same as c++?

0 Answers  


What is input operator in c++?

0 Answers  


How c functions prevents rework and therefore saves the programers time as wel as length of the code ?

0 Answers  


A prime number is a number which is divisible only by itself and 1. Examples of the first few primes are 2, 3, 5, 7, 11. Consider writing a program which can generate prime numbers for you. Your program should read in and set a maximum prime to generate and a minimum number to start with when looking for primes. This program should be able to perform the following tasks: 1. Read the maximum number from user (keyboard input) to look for primes. The program should not return any primes greater than this number. 2. Read the minimum number from user (keyboard input) to look for primes. The program should not return any primes less than this number. 3. Generate and print out every prime number between the maximum prime and minimum number specified by the user.

0 Answers  


What are enumerations?

0 Answers  


What is dangling pointers?and what is memory leak?

5 Answers  


Categories