Aryadev Chavali 8de4860e1d (btree)+struct for binary tree
Has a custom enum for ordering, as each type of data may have its own
comparator system.  Hence, each node will have a comparison function
pointer internally.  Though this increases the data required to create
a binary tree, it does make it easier to support multiple types.
2021-11-23 06:14:06 +00:00
2021-11-23 06:14:06 +00:00
2021-11-20 22:35:18 +00:00

Algorithms

Common algorithms in C/C++/Python depending on which one is the nicest/makes the most sense to use. This will include random maths stuff as well, such as making supporting mechanisms for, say, the use of group semantics.

Description
No description provided
Readme MIT 79 KiB
Languages
C++ 61.7%
C 16.7%
Racket 16.6%
Makefile 3.3%
Emacs Lisp 1.7%