Textbook implementations of CS basics in rust.
- Bubblesort.
- Quicksort.
- Mergesort.
- Mergesort with only O(log(n)) additional space.
- Max-Heap (on array).
- Heapsort.
- "All occurrences" binary search.
Just a toy implementation sufficient to tackle the MNIST database. The data files are assumed to be in {project-root}/resources (which is git-ignored), unzipped.
- Fetch training/test data.
- NN data structure.
- ReLu.
- Evaluation.
- Test.
- Gradient computation.
- Back-propagation.
- Gradient descent.
- Training.
- Usage of GPU?
- Analysis.