Last Updated : 19 Nov, 2018 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? (A) The algorithm uses dynamic programming paradigm (B) The algorithm has a linear complexity and uses branch and bound paradigm (C) The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm (D) The algorithm uses divide and conquer paradigm. Answer: (A) Explanation: Please see https://www.geeksforgeeks.org/dynamic-programming-set-3-longest-increasing-subsequence/Quiz of this Question Share your thoughts in the comments Add Your Comment Please Login to comment...