What is worst case complexity algorithm?
- 1 Answers
- 985 Views
- I also Faced
- E-Mail Answers
Answer / Nageshwar Kumar Choubey
The worst-case complexity of an algorithm refers to its maximum time or space complexity that can be achieved under certain conditions. For example, the worst-case complexity of Quick Sort is O(n^2) when the input array is already sorted or reverse-sorted.
| Is This Answer Correct ? | 0 Yes | 0 No |
How does a heap sort work?
Q # 1 : in which graph algorithm do we start finding vertices that should be first in the topological order and then apploy the fact that every vertex must come before its successors in the topolgical order.
What is the use of space complexity and time complexity?
What does enum do?
Which is better array or linked list?
Differentiate between hashmap and hashtable.
When ArrayIndexOutOfBoundsException occurs?
Does treemap preserve order?
Define general trees?
What is peek in stack?
Define a full binary tree ?
What is the default size of an arraylist?
Windows 
