The biggest sub-array problem of the divide-and-conquer strategy

Source: Internet
Author: User

Converting from stock trading to a problem of solving maximal subarray

Days 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
price 100 113 110 85 105 102 86 63 81 101 94 106 101 79 94 90 97
Change 13 -3 -25 20 -3 -16 -23 18 20 -7 12 -5 -22 15 -4 7
The time it takes to solve the brute force is O (n^2) uses the divide-and-conquer technique to solve the problem of maximal sub-arrays, assuming the required array is a[low. The largest sub-array of high]. Divide the Subarray into two sub-arrays of equal size, that is, find the central location of the sub-array, such as mid, and then consider solving two sub-arrays: A[low. Mid] and A[mid. High], and then a sub-array that spans the midpoint. Here is a

The biggest sub-array problem of the divide-and-conquer strategy

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.