Skip to content

Latest commit

 

History

History
19 lines (12 loc) · 586 Bytes

README.md

File metadata and controls

19 lines (12 loc) · 586 Bytes

Percolation

Problem description: http://coursera.cs.princeton.edu/algs4/assignments/percolation.html

I would like to make a visualized demo for the Percolation Problem. The algorithm used will be the weighted quick union.

MVP List:

  1. Modal: a n-by-n grid of sites, each grid can be either opened or blocked.
  2. Visualization of simulation
  3. Problem analysis

Eight Puzzle

MVP List:

  1. Design and simulate the eight puzzle problem.
  2. Visualization of simulation

If there is more time, I would like to add more algorithm demo to this project. Like: sorting algorithms.