Algorithms

Data Structure and Algorithms implementations in Python

Note This repository is meant to be used as a reference to learn data structures and algorithms in Python programming language.

Documentation TODO

Data structure

TO DO

• 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

• 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!