stella v0.6.0 API Reference
Modules
Ackermann function is one of the simplest example of a total computable function that is not primitive recursive.
Documentation for Binary search tree
data structure.
Binary search is a search algorithm that finds the position of a target value within a sorted array.
Documentation for Bubble sort
algorithm. All important
informations about counting sort you can find on
Wikipedia page.
Cartesian 2D and 3D plane
Documentation for Counting sort
algorithm. All important
informations about counting sort you can find at
Wikipedia page.
The Fibonacci polynomials are a polynomial sequence which can be considered as a generalization of the Fibonacci numbers.
Documentation for Insertion sort
algorithm. All important
informations about counting sort you can find at
Wikipedia page.
Documentation for PriorityQueue
data structure implemented on general balanced trees by Arne Andersson
These have no storage overhead compared to unbalanced binary trees, and
their performance is better than AVL trees.
Documentation for Quick sort
algorithm. All important
informations about counting sort you can find on
Wikipedia page.
Documentation for Vector 2D
.
Documentation for Vector 3D
.