ffernandoalves / algorithms

Data Structure Libraries and Algorithms implementation

Algorithms

Data Structure Libraries and Algorithms implementation in C++

Disclaimer
This repository is meant to be used as a reference to learn data structure and algorithm.

Data structure

• Dynamic Connectivity
  • Quick Find
  • Quick Union
  • Weighted Quick Union
• Sorting Algorithms
  • Bubble Sort
  • Counting Sort
  • Gnome Sort
  • Heap Sort
  • Insertion Sort
  • Merge Sort
  • Merge Bottom Up Sort
  • Merge Optimize Sort
  • Odd Even Sort
  • Quick Sort
  • Quick 3Way Sort
  • Quick Optimize Sort
  • Quick Select
  • Selection Sort
  • Shell Sort
• Stack (Array Implementation)
  • Balanced Paranthesis
  • Infix to Prefix
  • Track Current Maximum
• Queue (Array Implementation)
  • Reverse Queue
  • Sort Queue Without Extra Space
• LinkedList
  • Count Frequency
  • Detect Loop
  • Find Middle
  • Get Nth Node from End
  • Length of Loop
• Suffle
  • Using Fisher-Yates (Knuth) shuffling algorithm
• Binary Search Tree
  • BFS Traversal
  • DFS Traversal
  • Inorder Successor
  • Is BST?
• Binary Heap
  • Min Heap
  • Max Heap
• Search
  • Binary Search

TO DO

• Vertical Order Traversal of Tree
• Order Statistics of Tree
• Red Black Tree
• Deque using circular array
• Tree Varient
• Graph Varient
• cocktail sort
• comb sort

Contribution

Feel Free to contribute.
Please follow standard C++ Guidelines.