Assignment for Princeton's Algorithms I course. This program calculates the average amount of moves it takes for an N-by-N grid to have a path of open tiles from top to bottom. The grid starts full, and one tile is removed on each move. This algorithm completes this in N log N time.
-
Notifications
You must be signed in to change notification settings - Fork 0
Assignment for Princeton's Algorithms I course. This program calculates the amount of moves it takes for an N-by-N grid to have a path of open tiles from top to bottom. The grid starts full, and one tile is removed on each move.
jKard1210/Percolations
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Assignment for Princeton's Algorithms I course. This program calculates the amount of moves it takes for an N-by-N grid to have a path of open tiles from top to bottom. The grid starts full, and one tile is removed on each move.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published