max-subarray-sum 0.1.7

Finds the maximum subarray sum in a list.
Documentation 
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

//! # max_subarray_sum
//!
//! Finds maximum subarray sum in a list. This is also known
//! as max sum contigious subarray. If there are multiple such
//! subarrays, only the one that comes first is selected.
//!
//! The algorithm has time complexity of `O(N)` and space complexity
//! of `O(1)`.
//!
//! # Quick Start
//! ```
//! use max_subarray_sum::Elements;
//!
//! let list = vec![-2, -3, 4, -1, -2, 1, 5, -3];
//! 
//! //Or you can use an array instead:
//! let list = [-2, -3, 4, -1, -2, 1, 5, -3];
//!
//! let elements = Elements::new(&mut list);
//!
//! let max_sum = elements.find_max_sum().result();
//!
//! assert_eq!(7, max_sum);
//! ```
pub mod interface;