The main goal of the development is to refresh university knowledge and a deeper understanding of the details
C# implementation using netcore2.1
- Simple sort
- Bubble sort
- Insertion sort
- Selection sort
- Merge sort
- Quick sort
- Heap sort
- Linear search
- Binary search
- Interpolation search
- ArrayList
- ArrayList unit tests
- LinkedList
- Singly Linked List
- Doubly Linked List
- Circular Linked List
- Stack
- LinkedList implementation
- ArrayList implementaion
- Queue
- LinkedList implementation
- ArrayList implementaion
- HashTable
- Chaining
- Linear probing
- Quadratic probing
- Double hashing
- Trees
- Binary Tree
- InOrder/PreOrder/PostOrder traversal
- Level Order traversal
- Check for Complete
- Check for Full
- Check for Balanced
- Binary Search Tree (Extends Binary Tree)
- Insert
- Search
- Remove
- AVL Tree
- Red-Black Tree
- Binary Tree
- Graphs
- Graph (null graph)
- Undirected Graph
- Directed Graph
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Shortest Path - Dijkstra
- Shortest Path - Floyd Warshall
- Add Travis CI
- xUnit Tests