- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Dynamic Programming | Question 3
Last Updated :
Discuss
Comments
An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A[0 :n-1] is given below. Let Li denote the length of the longest monotonically increasing sequence starting at index i in the array.
Which of the following statements is TRUE?
The algorithm uses dynamic programming paradigm
The algorithm has a linear complexity and uses branch and bound paradigm
The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm
The algorithm uses divide and conquer paradigm.
This question is part of this quiz :
Top MCQs on Dynamic Programming with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy