DATA STRUCTURE
Programming and Technical
Programming
Technical
The best average behaviour is shown by
(A) Quick Sort (B) Merge Sort
(C) Insertion Sort (D) Heap Sort
Read Solution (Total 27)
-
- Quick Sort
- 10 years agoHelpfull: Yes(14) No(1)
- merge sort
- 10 years agoHelpfull: Yes(3) No(6)
- heap sort
although heap sort and merge sort both have same time complexity O(nlogn) but out of two of them heap sort is best to use. - 10 years agoHelpfull: Yes(2) No(3)
- Quick sort
- 10 years agoHelpfull: Yes(2) No(0)
- ocick short becz itf time complexict is logn
- 10 years agoHelpfull: Yes(2) No(0)
- ans is heap sort
- 10 years agoHelpfull: Yes(2) No(2)
- ans is d.Heap sort,because it's time complexity is o(log n)
- 10 years agoHelpfull: Yes(1) No(3)
- Answer can be Quick, Merge & Heap sort, as avg. time complexity for all these 3 algorithm is o(nlog n), but i think Heap sort is best.
- 10 years agoHelpfull: Yes(1) No(0)
- Heap sort.
If we compare merge and heap sort,The space complexity of heap sort is O(1). - 10 years agoHelpfull: Yes(1) No(0)
- Quick Sort
- 6 years agoHelpfull: Yes(1) No(1)
- i think merge sort.. if not can anyone post the correct answer
- 10 years agoHelpfull: Yes(0) No(2)
because quick sort gives avg behaavior- 10 years agoHelpfull: Yes(0) No(0)
- quick sort gives average behaviour
- 10 years agoHelpfull: Yes(0) No(0)
- a quick sort
- 9 years agoHelpfull: Yes(0) No(0)
- merge sort
- 9 years agoHelpfull: Yes(0) No(0)
- merge sort & exchange sort
- 9 years agoHelpfull: Yes(0) No(0)
- quick sort
- 9 years agoHelpfull: Yes(0) No(1)
- quick sort
- 9 years agoHelpfull: Yes(0) No(0)
- Merge sort
- 9 years agoHelpfull: Yes(0) No(1)
- A)Quick sort
- 9 years agoHelpfull: Yes(0) No(1)
- (A). Quick sort
- 8 years agoHelpfull: Yes(0) No(1)
- (C) in insertion sort we solve the problem step by step that's why it take more time to solve the problem
- 6 years agoHelpfull: Yes(0) No(0)
- Please tell me d correct answer..I am a Student..totally confused for u r replays..
- 6 years agoHelpfull: Yes(0) No(1)
- option A) Quick Sort,, is the correct answer of this question.
- 6 years agoHelpfull: Yes(0) No(0)
- Right answer. is [ Quick Sort ]
- 6 years agoHelpfull: Yes(0) No(0)
- heap sort is best because average time complexity of all algorithm is same except insertion. but space complexity of heap is mininmum hence heap is best one.
- 6 years agoHelpfull: Yes(0) No(0)
- heap sort
- 4 years agoHelpfull: Yes(0) No(0)
DATA STRUCTURE Other Question