Which of the following sorts is quickest when sorting the
following set: 1 2 3 5 4
1) Quick Sort
2) Bubble Sort
3) Merge Sort
Answer Posted / khushboo
BUbble sort
Quick Sort will take nlogn time and also merge sort
But bubble sort will take only O(n) as we can detect no
shift of position in first scan itself...
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
How do c compilers work?
What does 3 mean in texting?
what are bit fields in c?
What is use of bit field?
What are derived data types in c?
Write a program to identify if a given binary tree is balanced or not.
simple program of graphics and their output display
What is difference between stdio h and conio h?
What is array of structure in c?
Why n++ execute faster than n+1 ?
Write a program to print fibonacci series without using recursion?
Can a program have two main functions?
What is meant by realloc()?
Explain how do you sort filenames in a directory?
write a program that will open the file, count the number of occurences of each word in the the complete works of shakespeare. You will then tabulate this information in another file.