Interested to Buy Any Domain ? << Click Here >> for more details...
A list is ordered from smaller to largest when a sort is
called. Which sort would take the shortest time to execute?
- 17 Answers
- 33666 Views
- I also Faced
- E-Mail Answers
Answer Posted / gautam
heap sort is the correct answer because it requires log(n)
time where n is the number of nodes
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
Run time memory allocation is known as in data structure?
Is complete binary tree?
What is the default value of Array?
How to pass in data structure exam?
What do you mean by the term “percolate up”?
Does treemap allow null values?
How do you sort an array in decreasing order?
Explain about circular linked list?
How do you solve a selection sort?
How do you do a selection sort?
Which one is the simplest sorting in data structure?
Where the data structures are used?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What is weight balanced tree in data structure?
Define general trees?
