Skip to content
Code for popular sorting and graph exploration algorithms
Python Ruby
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitignore
2sum.rb
README.md
bellman_ford.py
dijkstra.rb
floyd_warshall.py
hamming_distance.py
hamming_distance_no_recursion.py
huffman.py
inversion.rb
k-clusters.py
karatsuba.rb
knapsack.py
knapsack_big.py
median.rb
mincut.rb
mwis.py
prims_mst.py
quicksort.rb
scc.rb
schedules.py
tsp.py
tsp_heuristic.py

README.md

Algorithms

These are assignments from a course on Algorithms I'm taking on Coursera. The course is divided into four parts. The exercises from parts 1 and 2 are in Ruby and the exercises from part 3 are in Python.

  • Part 1 covers Big O notation, sorting and searching, divide and conquer and randomized algorithms.
  • Part 2 covers graph search, shortest paths and data structures (heaps, balanced search trees, hash tables, bloom filters).
  • Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering) and dynamic programming (knapsack, sequence alignment, optimal search trees).

You can view the course here.

You can’t perform that action at this time.