advanced-algorithms

Note:

Please don't take effort to create pull requests for new algorithms or data structures. This is just a curiosity-driven personal hobby and was originally not intended to be a library. Feel free fork and modify to fit your need if that's what you are looking for. You can however open issues or fix bugs with pull requests, I would be happy to take a look when I get time

Advanced Algorithms

Various important computer science algorithms generically implemented in C#.

Install by nuget

For beta releases on beta branch

Install-Package Advanced.Algorithms -Pre

For stable releases on stable branch

Install-Package Advanced.Algorithms

• API documentation

Supports

• .Net Standard 1.0 or above
• .Net Framework 4.0 or above

Development environment

Windows

• Visual Studio Code as IDE for .NET core
• Visual Studio 2017 as IDE for .NET framework/.NET core

Mac OS

• Visual Studio Code as IDE for .NET core
• Visual Studio 2017 as IDE for Mono

Linux

• Visual Studio Code as IDE for .NET core
• Mono develop as IDE for Mono

Data structures

List

• Array list (dynamic array) (implementation | tests)
• Skip list (implementation | tests)

HashSets

• HashSet (using separate chaining optionally with open address linear probing) (implementation | tests)
• Ordered HashSet (implementation | tests)

Dictionaries

• Dictionary (using separate chaining optionally with open address linear probing) (implementation | tests)
• Ordered Dictionary (implementation | tests)

Stack

• Stack (using dynamic array and optionally using singly linked list) (implementation | tests)

Queue

• Queue (using dynamic array and optionally using doubly linked list) (implementation | tests)
• Priority queue (implementation | tests)

Linked list

• Singly linked list (implementation | tests)
• Doubly linked list (implementation | tests)
• Circular linked list (implementation | tests)

Heap

• Binary heap (implementation | tests)
• d-ary heap (implementation | tests)
• Binomial heap (implementation | tests)
• Fibonacci heap (implementation | tests)
• Pairing heap (implementation | tests)

Note: It is observed that among the implementations here, in practice, with the exclusion of UpdateKey (decrement/increment) operation, regular Binary Heap & d-ary Heap outperforms other in theory superiors. Likely because it doesn't have pointer juggling overhead and hey arrays are faster!

Tree

• Tree (implementation | tests)
• Binary tree (implementation | tests)

Binary search trees

• Binary search tree (implementation | tests)
• AVL tree (implementation | tests)
• Red black tree (implementation | tests)
• Splay tree (implementation | tests)
• Treap tree (implementation | tests)

B trees (database trees)

• B-tree (implementation | tests)
• B+ tree (implementation | tests)

Queryable trees

• Segment tree (implementation | tests)
• Binary indexed tree (Fenwick tree) ([implementati