sortingAlgorithms: Sorting algorithms for vectors and lists
In rgp: R genetic programming framework
Description
Usage
Arguments
Value
Description
These algorithms sort a list or vector by a given order relation (which
defaults to <=).
insertionSort is a stable O(n^2) sorting algorithm that is quite efficient
for very small sets (less than around 20 elements). Use an O(n*log(n)) algorithm
for larger sets.
Usage
1
insertionSort(xs, orderRelation = NULL)
Arguments
xs
The vector or list to sort.
orderRelation
The orderRelation to sort xs by (defaults to `<=`).
This relation by should reflexive, antisymetric, and transitive.
Value
The vector or list xs sorted by the order relation orderRelation.
rgp documentation built on May 30, 2017, 12:45 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 Value
Description
These algorithms sort a list or vector by a given order relation (which
defaults to <=).
insertionSort is a stable O(n^2) sorting algorithm that is quite efficient
for very small sets (less than around 20 elements). Use an O(n*log(n)) algorithm
for larger sets.
Usage
1 | insertionSort(xs, orderRelation = NULL)
|
Arguments
xs |
The vector or list to sort. |
orderRelation |
The orderRelation to sort |
Value
The vector or list xs sorted by the order relation orderRelation.
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.