The goal here is that each file demostrates a single concept in for quick reference.
- string_search.org: Naive and optimized string searching
- search_swahili.ipynb: Exploring search techniques with Swahili text
- model_from_scratch_mnist.ipynb: A simple ML model (almost) from scratch
- generating_pseudorandom_numbers.py: pseudo-random number generator
- generating_primes.py: Generating prime numbers
- gcd.py: Calculating the greatest common divisor
- square_root.py: Calculate square root of a number
- base_conversion.py: Convert a number from on base to another
- cosine.py: Calculate cosine using the taylor series
- factorials.py: Check if a number is a factorial
- simple_recursive_descent_parser.py: A simple recursive descent parser
- bit_manipulation.py: Bit manipulation
- binary_search.py: Binary Search
- quicksort.py: Quicksort
- hash_table.py: Hash table with separate chaining
- nth_fibonacci.py: Find the nth fibonacci number
- fibonacci_sequence.py: Different approaches to generating the fibonacci sequence
- heaps.py: Heap implementation
- heapsort.py: Heapsort
- binary_search_trees.org: Binary search tree basics
- kth_largest.py: Find kth largest element using binary search tree
- detect_linkedlist_cycle.org: Detect cycle in linked list
- reverse_linkedlist.py: Initialize and reverse a linked list
These are code samples from other sources that I include here for reference