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
- 31496 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
Can you sort a string?
How will you check the validity of an expression containing nested parentheses?
How do you find the size of an arraylist?
What is the difference between null and void pointer in data structures?
How does the size of arraylist increases dynamically?
What are the main differences between the linked list and linear array?
What is data structure geeksforgeeks?
Mention the steps to insert data at the starting of a singly linked list?
What is a simple path?
What is rule regarding overriding equals and hascode method?
State the rules to be followed during infix to prefix conversions?
What are dynamic data structures?
What is time and space complexity of bubble sort?
What happens if we put duplicate key in hashmap?
Is pointer a variable in data structure?
