naive: Function that finds the subarray which has the largest sum...
In maxime970/Algo: Some solutions to the Maximum subarray problem
Description
Usage
Arguments
Details
Value
Examples
Description
It takes an array as input and it spills out three values: the value of sum, the start and the end indexes in the original array
Usage
1
naive_solver(v)
Arguments
v
an array of length n>0
Details
The time complexity of this function is quadratic
Value
max
the sum of subarray found by the function
start
the starting index of the subarray in the original array
end
the ending index of the subarray in the original array
Examples
1
naive_solver(c(5, -5, 3, -5, 10, 10, -8, 9, -5))
maxime970/Algo documentation built on Jan. 26, 2021, 1:31 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value Examples
Description
It takes an array as input and it spills out three values: the value of sum, the start and the end indexes in the original array
Usage
1 | naive_solver(v)
|
Arguments
v |
an array of length n>0 |
Details
The time complexity of this function is quadratic
Value
max |
the sum of subarray found by the function |
start |
the starting index of the subarray in the original array |
end |
the ending index of the subarray in the original array |
Examples
1 | naive_solver(c(5, -5, 3, -5, 10, 10, -8, 9, -5))
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.