adplus-dvertising
frame-decoration

Question

Which of the following case does not exist in complexity theory?

a.

Best case

b.

Worst case

c.

Average case

d.

Null case

Answer: (d).Null case

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following case does not exist in complexity theory?

Similar Questions

Discover Related MCQs

Q. The complexity of linear search algorithm is _________

Q. The complexity of Binary search algorithm is _________

Q. The complexity of merge sort algorithm is _________

Q. The Worst case occur in linear search algorithm when _________

Q. The worst case complexity for insertion sort is _________

Q. The complexity of Fibonacci series is _________

Q. The worst case occurs in quick sort when _________

Q. The worst case complexity of quick sort is _________

Q. Which is used to measure the Time complexity of an algorithm Big O notation?

Q. If for an algorithm time complexity is given by O(1) then the complexity of it is ____________

Q. If for an algorithm time complexity is given by O(log₂n) then complexity will be ___________

Q. If for an algorithm time complexity is given by O(n) then the complexity of it is ___________

Q. If for an algorithm time complexity is given by O(n²) then complexity will ___________

Q. If for an algorithm time complexity is given by O((3⁄2)ⁿ) then complexity will be ___________

Q. The time complexity of binary search is given by ___________

Q. The time complexity of the linear search is given by ___________

Q. Which algorithm is better for sorting between bubble sort and quicksort?

Q. Time complexity of the binary search algorithm is constant.

Q. The binary notation of 231 is ___________

Q. The decimal notation of 101010101 is ___________