What is the best case time complexity of bubble sort?
- 1 Answers
- 1109 Views
- I also Faced
- E-Mail Answers
What is the best case time complexity of bubble sort?..
Answer / Sandeep Kumar
The best case time complexity of Bubble Sort is O(n) when the input array is already sorted or nearly sorted.
| Is This Answer Correct ? | 0 Yes | 0 No |
More Data Structures Interview Questions
Which sorting is stable?
Can a hashmap have duplicate keys?
List out the disadvantages of using a linked list?
Is null a binary search tree?
Write the procedure to convert general tree to binary tree?
List out the applications of a linked list?
What are the basic data structures?
Can we put null key in hashmap?
What is the order of selection sort?
Define red-black trees.
Define linear probing?
Difference between calloc and malloc in data structures?
Windows 
