C# Algorithms Implementation :)

This project contains a C# implementation of the algorithms and data structures.

Algorithms:

• Binary Search Tree
• Search
• Pre-, In-, Post- Traversal
• Is Binary Search Tree
• Graph
• Union Find (disjoint-sets data type)
• Breadth First Search
• Depth First Search

Sorts:

• Counting Sort
• Insertion Sort
• Merge Sort
• Quick Sort

Not Implemented:

• Bubble Sort
• Heap Sort
• Radix Sort
• Bucket Sort
• Selection Sort
• Shell Sort

Data Structures

• Linked List
• Doubly Linked List
• Queue (Array implementation)
• Queue (Linked List implementation)
• Stack (Array implementation)
• Stack (Linked List implementation)
• Binary Tree
• HashTable (Array with Doubly Linked List implementation)
• Trie
• Graph (Adjacency List)
• Graph (Objects)

Not Implemented:

• AVLTree
• BTree
• RedBlackTree

Each data structure is covered with nUnit tests.

Installation & Unsage

For running you will need to build the project.

Tests

To run the tests you need to open Test Explorer in Visual Studio ( Test - Windows - Test Explorer)