Which sorting algorithm is worst?
- 1 Answers
- 974 Views
- I also Faced
- E-Mail Answers
Answer / Hansraj Dwivedi
The worst-case time complexity of some sorting algorithms, such as Quicksort and Heapsort, can degrade to O(n^2) when the input data is poorly arranged. However, it's important to note that these algorithms are still considered efficient in practice due to their average-case time complexities.
| Is This Answer Correct ? | 0 Yes | 0 No |
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is max heapify?
What do you mean by an Array?
What is breadth first tree?
Is quicksort greedy algorithm?
What is bubble sort in data structure?
What is type structure?
What are the complexity of binary search?
What are trees in data structures?
What is raid (redundant array of inexpensive disks)?
What is hash value of a string?
What is data and data structure?
Windows 
