[solved]-Give O N2 Algorithm Pseudocode Given Sequence S Finds Longest Subsequence First Increases Q39081293

Give an O(n2 ) algorithm (Pseudocode) that, given asequence S, finds the longest subsequence that first increases thendecreases.

For instance, in the sequence S = [10, 4, 5, 11, 2, 7, 4, 3, 9]the longest such subsequence is [4,5,11,7,4,3]. The subsequencedoes not have to be consecutive. (Hint: Use two arrays, one forincreasing subsequences and the other for decreasingsubsequences.)

Expert Answer

---

Answer to Give an O(n2 ) algorithm (Pseudocode) that, given a sequence S, finds the longest subsequence that first increases then … . . .