Computational Complexity Theory

Q1. In the following cases, which of these does not exist in complexity theory?

Q2. The worst case occurs in quick sort when pivot is the smallest element.

Q3. From which of these the best behaviour is shown?

Q4. What is the complexity of fibonacci series?

Q5. What is the complexity of binary search algorithm is?

Q6. If you are asked to sort 15 randomly generated numbers,what would you prefer?

Q7. What is the complexity of linear search algorithm is?

Q8. What is the complexity of merge sort algorithm is?

Q9. What is the complexity of bubble sort algorithm is?

Q10. What is the worst case complexity of quick sort?