Would you rather wait for the results of a quicksort, a
linear search, or a bubble sort on a 200000 element array?




1) Quicksort


2) Linear Search


3) Bubble Sort

Answers were Sorted based on User's Feedback



Would you rather wait for the results of a quicksort, a linear search, or a bubble sort on a 20000..

Answer / bukke ramesh naik

quicksort is best one compare two others because quick sort
takes node lists

Is This Answer Correct ?    2 Yes 3 No

Would you rather wait for the results of a quicksort, a linear search, or a bubble sort on a 20000..

Answer / shruti

Quicksort is a better option compared to the other twoo...

Is This Answer Correct ?    4 Yes 6 No

Would you rather wait for the results of a quicksort, a linear search, or a bubble sort on a 20000..

Answer / vishnu948923

Quicksort

Is This Answer Correct ?    3 Yes 8 No

Post New Answer

More C Interview Questions

Find errors (1) m = ++a*5; (2) a = b ++ -c*2; (3)y = sqrt (1000);

5 Answers  


explain what is an endless loop?

0 Answers  


WHAT IS THE DIFFERENCE BETWEEN malloc() and calloc() in c file management?

28 Answers   3D PLM, Code Studio, Deltech, IBM,


what is the difference between : func (int list[], ...) or func (int *list , ....) - what is the difference if list is an array and if also if list is a pointer

2 Answers  


What are loops in c?

0 Answers  


What is #include in c?

0 Answers  


what is the self-referential structure?

1 Answers  


What is %d used for?

0 Answers  


How do shell structures work?

0 Answers  


Write a program to swap two numbers without using third variable?

0 Answers  


What are lookup tables in c?

0 Answers  


Calculate 1*2*3*____*n using recursive function??

0 Answers  


Categories