C# ALGORITHMS

A C# plug-and-play class-library project of standard Data Structures and Algorithms. It contains 35+ Data Structures and 30+ Algorithms designed as Object-Oriented isolated components. Even though this project started for educational purposes, the implemented Data Structures and Algorithms are standard, efficient, stable and tested.

DESCRIPTION

This project originally started out as an interview preparation project. However, after receiving a great amount of positive responses on reddit, and noticing excitement from a few GitHubers to contribute furthermore to it, the project took on a different meaning. So, I decided to keep maintaining it as a reference for data structures and algorithm implementations in C# as well as my own research side-project under these topics.

Solution Hierarchy:

This is a C#.NET solution-project, and it contains three subprojects:

1. Algorithms: A class library project. Contains the Algorithms implementations.
2. Data Structures: A class library project. Contains the Data Structures implementations.
3. Main Program: Contains tests for the data structures and algorithms projects.

Requirements:

1. C# 5
2. .NET 4.5
3. NUnit

A Note to Contributors:

If you wish to contribute to C# ALGORITHMS, then please make sure you check out the Contribution Guidelines first.

Note: The projects where tested on Xamarin Studio (MonoDevelop) on OSX 10, and Visual Studio on Windows 7.

DATA STRUCTURES

Lists:

• Skip List.
• Array List.
• Stack.
• Queue.
• Single-Linked List.
• Double-Linked List.

Heaps:

• Binary-Min Heap.
• Binary-Max Heap.
• Binomial-Min Heap.

Priority Queues:

• Min-Priority Queue.
• Keyed Priority Queue.

Hashing Functions:

• Prime Hashing Family.
• Universal Hashing Family.

Hash Tables:

• Chained Hash Table.
• Cuckoo Hash Table.

Sorted Collections (Tree-based):

• Sorted List.
• Sorted Dictionary.

Trees:

• Trie.
• Trie Map.
• AVL Tree.
• Red-Black Tree.
  • Map version. Supports key-value pairs nodes; indexes nodes by keys.
• Binary Search Tree.
  • Map version. Supports key-value pairs nodes; indexes nodes by keys.
• Augmented Binary Search Tree.

Graphs:

• Undirected Graphs:
  • Clique Graphs.
  • Undirected Sparse Graph.
  • Undirected Dense Graph.
• Undirected Weighted Graphs:
  • Undirected Weighted Sparse Graph.
  • Undirected Weighted Dense Graph.
• Directed Graphs:
  • Directed Sparse Graph.
  • Directed Dense Graph.
• Directed Weighted Graphs:
  • Directed Weighted Sparse Graph.
  • Directed Weighted Dense Graph.

ALGORITHMS

Sorting:

• Bubble Sort.
• Bucket Sort.
• BST Sort.
• Comb Sort.
• Counting Sort.
• Cycle Sort.
• Gnome Sort.
• Heap Sort.
• Insertion Sort.
• LSD Radix Sort.
• Merge Sort.
• Selection Sort.
• Shell Sort.
• OddEven Sort.
• PigeonHole Sort.
• Quick Sort.

Graphs:

• Graph Search:
  • Depth-First Searcher.
  • Breadth-First Searcher.
• Shortest Paths:
  • Breadth-First SPs.
  • Bellman-Ford SPs.
  • Dijkstra SPs.
  • Dijkstra All-Pairs SPs.
• DFS Applications:
  • Cycles Detector.
  • Topological Sorter.
• BFS Applications:
  • Connected Components.
  • Bipartite Graphs Coloring.

Trees:

• Recursive Binary Tree Walker.
  • Methods: PrintAll, ForEach, Contains and BinarySearch. Traversal Modes: Preorder, Inorder & Postorder.

Strings:

• Permutations and Anagrams.
• Edit Distance.
  • Uses a generic custom class for passing costs: EditDistanceCostsMap<T>.

Numeric:

• Catalan Numbers.
• Greatest Common Divisor

Visualization:

• Tree Drawer.

CONTRIBUTORS

• Edgar Carballo Domínguez.
• Lucas Lemaire.

LICENSE

This project is licensed under the MIT License.