Skip to main content

SW Vis

Fixed & Dynamic Window
k

Initializing...

Speed1x
Algorithm Details
Best Time
Ω(n)
Worst Time
O(n)
Space
Θ(n)
Sliding Window
1Algorithm MaxSumSubarray(arr, k):
2 windowSum = sum of first k elements
3 maxSum = windowSum
4
5 For end from k to length - 1:
6 windowSum -= arr[end - k]
7 windowSum += arr[end]
8 If windowSum > maxSum:
9 maxSum = windowSum
10
11 Return maxSum