Scribd
Upload
18 views

Maximum Subarray Problem

This document discusses the maximum subarray problem and an algorithm to solve it in divide-and-conquer fashion. The maximum subarray problem is to find a contiguous subarray from a given array that has the largest sum. The divide-and-conquer algorithm divides the array into two halves, finds maximum subarrays within each half and crossing the midpoint, and returns the largest of the three. It runs in O(nlogn) time by recursively dividing the problem into smaller subproblems.

Uploaded by

Farrukh Abbas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

Maximum Subarray Problem

This document discusses the maximum subarray problem and an algorithm to solve it in divide-and-conquer fashion. The maximum subarray problem is to find a contiguous subarray from a given array that has the largest sum. The divide-and-conquer algorithm divides the array into two halves, finds maximum subarrays within each half and crossing the midpoint, and returns the largest of the three. It runs in O(nlogn) time by recursively dividing the problem into smaller subproblems.

Uploaded by

Farrukh Abbas
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Design and Analysis of Algorithms

Maximum-subarray problem

Slides from Haidong Xue


Maximum-subarray problem
back ground
• If you know the price of certain stock from day
i to day j;
• You can only buy and sell one share once
• How to maximize your profit?
120

110

100
Price

90

80

70

60
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
day #
Maximum-subarray problem
back ground
• What is the brute-force solution?
max = -infinity;
for each day pair p {
if(p.priceDifference>max)
max=p.priceDifference;
}
𝑛
Time complexity? 2
pairs, so O(𝑛2 )
Maximum-subarray problem
back ground
• If we know the price difference of each 2
contiguous days
• The solution can be found from the
maximum-subarray
• Maximum-subarray of array A is:
– A subarray of A
– Nonempty
– Contiguous
– Whose values have the the largest sum
Maximum-subarray problem
back ground
Day 0 1 2 3 4
Price 10 11 7 10 6
Difference 1 -4 3 -4

What is the solution? Buy on day 2, sell on day 3

Can be solve it by the maximum-subarray of difference array?

Sub-array 1-1 1-2 1-3 1-4 2-2 2-3 2-4 3-3 3-4 4-4
Sum 1 -3 0 -4 -4 -1 -5 3 -1 -4
Maximum-subarray problem – divide-
and-conquer algorithm
• How to divide?
– Divide to 2 arrays
• What is the base case?
• How to combine the sub problem solutions to the
current solution?
– A fact:
• when divide array A[i, …, j] into A[i, …, mid] and A[mid+1, …, j]
• A sub array must be in one of them
– A[i, …, mid] // the left array
– A[mid+1, …, j] // the right array
– A[ …, mid, mid+1….] // the array across the midpoint
– The maximum subarray is the largest sub-array among
maximum subarrays of those 3
Maximum-subarray problem – divide-
and-conquer algorithm
• Input: array A[i, …, j]
• Ouput: sum of maximum-subarray, start point of maximum-
subarray, end point of maximum-subarray
• FindMaxSubarray:
1. if(j<=i) return (A[i], i, j);
2. mid = floor(i+j);
3. (sumCross, startCross, endCross) = FindMaxCrossingSubarray(A, i,
j, mid);
4. (sumLeft, startLeft, endLeft) = FindMaxSubarray(A, i, mid);
5. (sumRight, startRight, endRight) = FindMaxSubarray(A, mid+1, j);
6. Return the largest one from those 3
Maximum-subarray problem – divide-
and-conquer algorithm
FindMaxCrossingSubarray(A, i, j, mid)
1. Scan A[i, mid] once, find the largest A[left,
mid]
2. Scan A[mid+1, j] once, find the largest
A[mid+1, right]
3. Return (sum of A[left, mid] and A[mid+1,
right], left, right)

Let’s try it in Java


Target array : 1 -4 3 2

All the sub arrays: 1 1

-4 -4

3 3

2 2

1 -4 -3

-4 3 -1

Max! 3 2 5

1 -4 3 0

-4 3 2 1

1 -4 3 2 2
Target array : 1 -4 3 2 Divide target array into 2
arrays

1 We then have 3 types of


All the sub arrays: 1
subarrays:
The problem can be -4 -4
The ones belong to the left
then solved by:
3 3 array
1. Find the max in left The ones belong to the right
sub arrays 2 2
array
2. Find the max in right 1 -4 -3 The ones crossing the mid
sub arrays point
-4 3 -1
3. Find the max in
crossing sub arrays 3 2 5

1 -4 3 0

4. Choose the largest -4 3 2 1


one from those 3 as the
final result 1 -4 3 2 2
FindMaxSub ( 1 -4 3 2 )

1. Find the max in left sub arrays FindMaxSub ( 1 -4 )

2. Find the max in right sub arrays FindMaxSub ( 3 2 )

3. Find the max in crossing sub arrays

Scan 1 -4 once, and scan 3 2 once

4. Choose the largest one from those 3 as the final


result
3. Find the max in crossing sub arrays

1 -4 3 2

-4 Sum=-4

1 -4 Sum=-3 largest

3 Sum=3

3 2 Sum=5 largest

The largest crossing subarray is :


Time Complexity

You might also like