My approach involves iterating through every element in the matrix, then for each land (true value), I visit every connected land and make it false. Currently, the complexity is O(N).
mirunamd/Assignment4
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published