sharpach / algorithms

Algorithms and data structures exercises

Algorithms

Some algorithms implementation for self-training.

Contributing

See Contributing.md

Implemented Algorithms

Algorithm / Data structure	C#
A*	✔️
Binary heap	✔️
Binary search tree	✔️
Brackets Balance	✔️
B-tree
Catalan numbers	✔️
Decision tree	✔️
Dijkstra’s algorithm
Factorization	✔️
Fenwick tree	✔️
Fowler–Noll–Vo hash function	✔️
Graph - DFS, BFS	✔️
Hashtable	✔️
Huffman coding
Knuth–Morris–Pratt string-searching algorithm	✔️
N-ary tree	✔️
Red-Black tree	✔️
Reverse polish notation	✔️
Segment tree	✔️
Splay tree	✔️
Topological sort	✔️
Trie	✔️

algorithms's Issues

[Data structure] Splay tree

[Algorithm] Binary Search

Implement https://en.wikipedia.org/wiki/Binary_search_algorithm

[Algorithm] Topological sort

[Algorithm] Implement K-means algorithm

[Data Structure] Hashtable

[Algorithm] Fowler–Noll–Vo hash function

[Algorithm] Implement K-means algorithm

[Algorithm] Dijkstra’s algorithm

[Algorithm] Implement Segment tree for range minimum query

[Data structure] N-ary tree

[Algorithm] Huffman coding

Huffman coding implementation

Reverse polish notation

[Algorithm + Data Structure] Graph - DFS, BFS

[Algorithm] Knuth–Morris–Pratt string-searching algorithm

https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm

Trie

https://en.wikipedia.org/wiki/Trie

[Data Structure] Red-black tree

[Algorithm] Pseudo-random numbers generator

[Algorithm] Implement Dijkstra's algorithm

[Algorithm] Factorization

binary search tree

public object DeleteNode (object data)

{

 TNode tempDelete = this.GetNode(data);

 if (tempDelete != null)

 {

    if ((tempDelete.Left == null ) &&(tempDelete.Right == null)) //Its a Leaf node

    {

       tempParent = tempDelete.Parent;

       if(tempDelete == tempParent.Left) //Justremove by making it null

           tempParent.Left = null;

       else

           tempParent.Right = null;

    }

    else if ((tempDelete.Left == null ) ||(tempDelete.Right == null)) //It has either Left orRight child

    {

       tempChild = tempDelete.Left == null? tempDelete.Right : tempDelete.Left; //Get the child

       tempParent = tempDelete.Parent; //Getthe parent

       if(tempDelete == tempParent.Left) //Makeparent points to it's child so it will automatically deleted like Linked list

           tempParent.Left = tempChild;

       else

           tempParent.Right = tempChild;

      }

      else if ((tempDelete.Left != null) ||(tempDelete.Right != null)) //It has both Left andRight child

     {

        TNodepredNode = this.GetNode(this.TreePredecessor_Ite(data));  //Findit's predecessor

        if(predNode.Left != null) // Predecessor node canhave no or left child. Do below two steps only if it has left child

        {

             tempChild = predNode.Left;

             predNode.Parent.Right = tempChild; //Assignleft child of predecessor to it's Parent's right.

         }

         tempDelete.Data = predNode.Data; //Replace the value of predecessor nodeto the value of to be deleted node

               //predNode = null; //Remove predecessornode as it's no longer required.

     }



     return data + " Deleted";

 }

 else

      return "Please enter the valid tree element!";

[Data Structure] Binary search tree

BST implementation

Binary heap

[Algorithm] A*

[Data Structure] B-tree

[Data Structure] Decision tree