README
¶
goalgs
Common and not-so common algorithms implemented in Go! Withal is also a utilities library for measuring the performance and auxilliary random number generator.
The app can be installed and built in any sensible Go envirnonment by running
go get github.com/paulidealiste/goalgs
Algorithm list by group
- Sort and permutation
- Bubble sort
- Insertion sort
- Merge sort
- Heap sort
- Quick sort
- Random permutation by sort
- Random permutation in-place
- Extremes
- Global extremes
- All of local extremes
- Maximum and minimum sum subarray
- Least and largest differences
- Data structures
- Max-heap
- Max-heap maintenace methods (max, extractmax, increasekey, insert)
- Binary search tree (untested)
Available utilities
- Random numbers by Box-Muller transform
The output from the goalgs is printed in the standard output with the coloring help from color go package.
Documentation
¶
There is no documentation for this package.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
datagen holds procedures for creating various data structures
|
datagen holds procedures for creating various data structures |
|
extremegen holds implementations of various extreme findining algorithms
|
extremegen holds implementations of various extreme findining algorithms |
|
rangen is a utility package for creating slices of random numbers.
|
rangen is a utility package for creating slices of random numbers. |
|
sortgen holds the implementations of the most common sorting and permutation algorithms.
|
sortgen holds the implementations of the most common sorting and permutation algorithms. |
|
utilgen holds various utility function primarily for documenting the algs output and performance as well as some common generic-like functions
|
utilgen holds various utility function primarily for documenting the algs output and performance as well as some common generic-like functions |
Click to show internal directories.
Click to hide internal directories.