A generalized insertion sort that works on all data types. Using this as a replacement to sort or order would be an inefficient choice. However, implementing complex distance algorithms allows for unusual applications, such as arbitrary sorting criteria, clustering, and solving the travelling salesman problem.
|Author||Craig Varrichio <[email protected]>|
|Maintainer||Craig Varrichio <[email protected]>|
|Package repository||View on GitHub|
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.