Algorithms and Data Structures

A single repository for Algorithms and Data Strutures written in Python.

*this repo is an emulation yangshun/lago

Algorithms

• Search Algorithms:
  • Binary Search
• Search N-th Term Algorithm:
  • Quickselect <--need to redo
• Sorting Algorithms:
  • Merge Sort
  • Quicksort
  • Heap Sort
  • Timsort
  • Topological Sort
• Node Algorithms:
  • Breadth First Search
  • Depth First Search
  • Djikstra's Algorithm
• Extras:
  • Bellman-Ford Algorithm
  • Floyd Warshall Algorithm

Data Structures

• List
• Stack
• Queue
• Binary Search Tree
• Trie
• AVL Tree
• Suffix Tree
• Segment Tree
• Graphs
• N-D arrays
• Bloom Filter

Time Complexity

A helpful reminder on Time Complexity using a graph.

What this pretty graph is essentially saying, from best to worst:

Run Time	Ranking
O( 1 )	TUBULAR!
O( logn )	AWESOME!
O( n )	meh
O( nlogn )	Not good...
O( n^2 )	Terrible.

Running

This repo requires Python 2.x installed. Clone the repo, and run:

python lib/index.py

Test functions are under index/testers.