Silvochka / algorithms

Popular algorithms on C#, data structures and solutions for Cracking the Code Interview

Sorting and data structure algorithms

This repo is a C# library with implemented sorting alrogithms, structures and its algorithms.

SortingAlgorithms:

• Stable, generic:
  • Bubble sort
  • Cocktail sort
  • Gnome sort
  • Insertion sort
  • Merge sort
  • OddEven sort
• Unstable, generic:
  • Heap sort
  • Quick sort
  • Selection sort
  • Shell sort
• Non-comparison based algorithms:
  • Bucket sort - implemented for integer
  • Couting sort (stable) - implemented for integer
  • Couting sort (unstable) - implemented for integer
  • LSD Radix - implemented for integer
  • MSD Radix - implemented for strings

Data stuctures:

• Hash tables
  • Implementations
    • With linked list usage
    • With linear probing
    • With quadratic probing
    • With double hashing probing
  • Algorithms
    • Add
    • Contains
    • Remove
    • Clear
• Binary search tree
  • Insert
  • Find
  • Remove
  • Traverse
    • Infix (recursive and iteration implementation)
    • Prefix (recursive and iteration implementation)
    • Postfix (recursive and iteration implementation)
    • Breadth (iteration implementation)
  • Verify
  • GetMin
  • GetMax
  • GetPredecessor
  • GetSuccessor
  • GetKElementInOrder
  • SplitByKey
  • Merge (with tree where keys > than keys in this tree)
  • RotateLeft
  • RotateRight
  • GetCommonRoot(key1, key2)
  • GetDistance(key1, key2)
• Binary search tree node
  • HasParent
  • IsTerminate
  • Count
  • Height
  • Degree
  • Depth
  • Level
• AVL tree
  • Insert
  • Verify
  • Remove
  • RebalanceIn
• AVL tree node
  • Balance factor

Tests

This library has generic tests for each sorter. New added sorter is testing automatically using Reflection. Currently it tests next types of array:

• Integer
• Double
• String
• Char

Each type tested on next inputs:

• Sorted sequense
• Reverted sorted sequense
• Random shuffled sequense
• Empty array

Each implemented data structures has tests which covering as much as possible.