You are given an unsorted array of integers which may contain negative numbers. Example: [2, -3, 0, 5, -2, -5, -1] Devis
Posted: Wed Apr 27, 2022 3:47 pm
You are given an unsorted array of integers which may contain
negative numbers. Example: [2, -3, 0, 5, -2, -5,
-1] Devise a DIVIDE AND CONQUER
ALGORITHM that finds the largest
SEQUENTIAL subsequence in the array. The largest
subsequence in the above example is bold. For clarification, the
algorithm should find the largest subsequence in the set of both
increasing and decreasing subsequences. Please
provide answer using Python.
negative numbers. Example: [2, -3, 0, 5, -2, -5,
-1] Devise a DIVIDE AND CONQUER
ALGORITHM that finds the largest
SEQUENTIAL subsequence in the array. The largest
subsequence in the above example is bold. For clarification, the
algorithm should find the largest subsequence in the set of both
increasing and decreasing subsequences. Please
provide answer using Python.