This is a project that shows theoretical and applied computer science concepts. This project is mainly for my learning but can be used as a resource for others.

All of my topics will include a README.md that details how the concept works theoretically then two python files. One file will be the concept in code, the other file will be a test file.

All of these topics will be covered. If there is no link to the topic then I have not gotten to it yet.

• Array
• Linked List
• Hash Table
• Stack
• Queue
• Tree
• Binary Tree
• Binary Search Tree
• Heap
• Graph
• Matrix
• Set
• Maps
• Circular Buffer
• Vector
• MultiBag (Multiset)
• Trie
• Radix Tree
• B Trees
• Red Black Tree
• AVL

• Insertion Sort
• Selection Sort
• Merge Sort
• Bubble Sort
• Heap Sort
• Quick Sort
• Shell Sort
• Radix Sort

• Linear Search
• Binary Search
• Interpolation Search

• Algorithm Efficiency with Big O
• Restful Api
• Bit Manipulation
• Recursion
• Base Conversion
• SQL
• NoSQL
• Threading
• Garbage Collector

• Write unit tests for all code

• Write code snippets in all languages
• Add Circular Buffer

All my diagrams are made using the website https://www.draw.io/

If you don't understand a part of my explanation, or you feel something is wrong. Submit a pull request or open a issue and I'll fix it!