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
- 16391 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
How can I write a function analogous to scanf?
What are different types of pointers?
What is difference between static and global variable in c?
which is an algorithm for sorting in a growing Lexicographic order
What is a char c?
How can I sort more data than will fit in memory?
How do you search data in a data file using random access method?
How does pointer work in c?
What do you mean by c what are the main characteristics of c language?
How can I read/write structures from/to data files?
Write a program which returns the first non repetitive character in the string?
Can a program have two main functions?
Is c call by value?
Write a function stroverlap that takes (at least) two strings, and concatenates them, but does not duplicate any overlap. You only need to worry about overlaps between the end of the first string and the beginning of the second string. Examples: batman, manonthemoon = batmanonthemoon batmmamaman, mamamanonthemoon = batmmamamanonthemoon bat, man = batman batman, batman = batman batman, menonthemoon = batmanmenonthemoon
which is conditional construct a) if statement b) switch statement c) while/for d) goto
