BaoHung/algorithms-design-and-analysis

Learning Algorithms: Design and Analysis on Coursera.

Algorithms: Design and Analysis

Completed the six weeks' course Algorithms: Design and Analysis, Part I on Coursera, instructed by Tim Roughgarden, Standford University.

####Quick Direction to Problems: #####Divide and Conquer:

• count inversions
• matrix multiplication
• merge sort
• the closest pair

#####Randomized Algorithm:

• quick sort
• linear time selection (find median in linear time)

#####Graph:

• dijkstra shortest path
• karger minimum cut
• kosaraju strong connected components

#####HashTable:

• two sum

#####Heap:

• median maintenance
• optimized dijkstra
• heap sort (using self implemented heap structure)

#####Greedy Algorithm:

• weight length scheduling
• prim minimum spanning tree

####Statements of accomplishment Part 1, course from January 19, 2015 to March 14, 2015. Grade achieved: 100%.