Which sorting technique is faster?
- 1 Answers
- 1000 Views
- I also Faced
- E-Mail Answers
Answer / Ratan Singh
The answer to this question can vary based on the specific use case and size of data. However, in general, quicksort and mergesort are often considered faster than bubble sort for larger datasets due to their average and best-case time complexities (O(n log n)). While the worst-case complexity of quicksort is also O(n^2), it's less common compared to bubble sort, which has a worst-case complexity of O(n^2).
| Is This Answer Correct ? | 0 Yes | 0 No |
Is queue fifo or lifo?
How does a dynamic array work?
How do you create a tree diagram?
What data structure underlies a python list?
What do you mean by open addressing?
Which sorting algorithm is worst?
how to display Singly Linked List from First to Last?
What is a list of lists?
What is selection sort with example?
What are data members?
What is heap tree explain with example?
Difference between abstract data type, data type and data structure?
Windows 
