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 longest time to execute?
- 12 Answers
- 31758 Views
- I also Faced
- E-Mail Answers
Answer Posted / rahul
Bubble Sort cannot be the answer, Because the MODIFIED BUBBLE SORT takes complexity of O(n) when the elements are arranged in a particular order..
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
What happens when arraylist is full?
What is difference between hashmap and hashset?
Describe the level term in a tree.
What is difference between capacity and size of arraylist?
What is the easiest sorting method to use in data structures?
How would you check if a binary tree is BST or not ? Write a program.
What is stable sorting method?
What is weight balanced tree in data structure?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
What is complexity algorithm?
Define union-by-weight?
What is the difference between the hash table and hash map?
Which programming language is best for data structures?
Why is it called bubble sort?
How does a binary search work?
