This package contains some solutions to the Maximum subarray problem implemented in both R and C++. The aim is to compare the speed of interpreted and compiled language. A first naive solution was implemented in both langagues, then compared to more advanced algorithms like Kadane's algorithm. Examples are included with the time needed to compute these algorithms on a given dataset.
Package details |
|
---|---|
Author | Maxime GRANDVAUX, Guillaume SHI DE MILLEVILLE, Sidiya BABAH |
Maintainer | Maxime GRANDVAUX <adresse.mail@gmail.com> |
License | GPL (>= 2) |
Version | 1.0 |
Package repository | View on GitHub |
Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.