Splash07 / algorithms

Data Structure Libraries and Algorithms implementation

Algorithms

Data Structure Libraries and Algorithms implementation in Go

Disclaimer
This repository is meant to be used as a reference to learn data structure and algorithm in Go programming language.
To reduce unnecessary language complexity, all the programs only uses integer or string dataset.

Documentation
Click to view goDoc Documentation

Data structure

• Sorting Algorithms
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Quick Select
  • Shell Sort
  • Heap Sort
• Stack (Array Implementation)
  • Infix to Postfix
  • Infix to Prefix
  • Infix Evaluation
• Queue (Array Implementation)
• LinkedList
  • Singly Linked List
  • Doubly Linked List
• Shuffle (Using Fisher-Yates (Knuth) shuffling algorithm)
• Binary Search Tree
• Binary Heap
  • Min Heap
  • Max Heap
• Red Black Tree
• Search
  • Binary Search

TO DO

• Vertical Order Traversal of Tree
• Order Statistics of Tree
• Red Black Tree Deletion
• B-Tree
• Deque using circular array
• Tree Varient
• Graph Varient
• cocktail sort
• gnome sort
• comb sort
• odd-even sort
• counting sort

Contribution

Feel Free to contribute.
Please follow standard GoLang Guidelines.