-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathlargest_continous_subarray.rb
56 lines (48 loc) · 1.08 KB
/
largest_continous_subarray.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
# largest continous subarray
def largest_continous_subarray_brutforce(ar)
largest_sum = 0
(0...ar.length - 1).each do |i|
sum = ar[i]
(i + 1...ar.length).each do |j|
sum += ar[j]
largest_sum = sum if sum > largest_sum
end
end
largest_sum
end
def largest_subarray_kadanes_algo(ar)
max_so_far = 0
max_ending_here = 0
ar.each do |e|
max_ending_here += e
max_ending_here = 0 if max_ending_here < 0
max_so_far = max_ending_here if max_ending_here > max_so_far
end
max_so_far
end
def largest_subarray_kadanes_print_index(ar)
max_so_far = 0
max_ending_here = 0
start = 0
ending = 0
i = 0
s = 0
ar.each do |e|
max_ending_here += e
if max_ending_here < 0
max_ending_here = 0
s = i + 1
end
if max_ending_here > max_so_far
max_so_far = max_ending_here
ending = i
start = s
end
i += 1
end
[start, ending]
end
ar = [-2, -3, 4, -1, -2, 1, 5, -3]
# puts largest_continous_subarray_brutforce(ar)
# puts largest_subarray_kadanes_algo(ar)
puts largest_subarray_kadanes_print_index(ar).to_a