Question
a.
O(1)
b.
O(n)
c.
O(n^2)
d.
O(n^3)
Posted under Recursion Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array?
Similar Questions
Discover Related MCQs
Q. Which of the following methods can be used to find the largest and smallest number in a linked list?
View solution
Q. What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list?
View solution
Q. What is the time complexity of the recursive implementation used to find the largest and smallest element in a linked list?
View solution
Q. Which of the following techniques can be used to search an element in an unsorted array?
View solution
Q. Consider the array {1,1,1,1,1}:
Which of the following techniques can be used to search an element in the above array?
View solution
Q. What is the time complexity of the above recursive implementation of linear search?
View solution
Q. Which of the following methods can be used to search an element in a linked list?
View solution
Q. What is the time complexity of the above implementation of linear search on a linked list?
View solution
Q. Can binary search be applied on a sorted linked list in O(Logn) time?
View solution
Q. What will be time complexity when binary search is applied on a linked list?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
