Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 7 Answers
- 16654 Views
- I also Faced
- E-Mail Answers
Answer Posted / rohith
quick sort is the best sorting algorithm because time
complexity is O(nlogn)
| Is This Answer Correct ? | 5 Yes | 0 No |
Post New Answer View All Answers
What are the functions to open and close file in c language?
What is the difference between abs() and fabs() functions?
How macro execution is faster than function ?
Write a program that takes a 5 digit number and calculates 2 power that number and prints it(should not use big integers and exponential functions)
What is the scope of an external variable in c?
What are local static variables?
#include main() { enum _tag{ left=10, right, front=100, back}; printf("left is %d, right is %d, front is %d, back is %d",left,right,front,back); }
What does c in a circle mean?
What is selection sort in c?
can any one provide me the notes of data structure for ignou cs-62 paper
What does 4d mean in c?
How to draw the flowchart for structure programs?
What is a pointer value and address in c?
7-Given an index k, return the kth row of the Pascal's triangle. For example, when k = 3, the row is [1,3,3,1]. For reference look at the following standard pascal’s triangle.
If a variable is a pointer to a structure, then which operator is used to access data members of the structure through the pointer variable?
