Commit 0929ca2

committed

doc: add time and space complexities and reasoning

1 parent 97ee638 commit 0929ca2Copy full SHA for 0929ca2

File tree

+16

-0

lines changed

+16

-0

lines changed

Lines changed: 16 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -102,3 +102,19 @@ def inbounds(grid: List[List], r: int, c: int) -> bool:`
`102`	`102`	`col_inbounds = 0 <= c < len(grid[0])`
`103`	`103`
`104`	`104`	`return row_inbounds and col_inbounds`
	`105`	`+`
	`106`	`+"""`
	`107`	`+Time and Space Complexities:`
	`108`	`+`
	`109`	`+- Time Complexity: O(r * c) where r is the number of rows and c is the number of columns in the grid. This is because each cell is processed a constant number of times.`
	`110`	`+- Space Complexity: O(r * c) for the visited set and the queue, as we might need to store all the cells in the worst case.`
	`111`	`+`
	`112`	`+Further Notes:`
	`113`	`+- Approach:`
	`114`	`+ - The algorithm uses Depth-First Search (DFS) to identify the first island.`
	`115`	`+ - Breadth-First Search (BFS) is then used to find the shortest bridge to another island by traversing water cells.`
	`116`	`+ - The BFS ensures that the shortest path is found due to its level-wise exploration.`
	`117`	`+- Reasoning:`
	`118`	`+ - Starting with DFS helps in identifying all connected cells of the first island.`
	`119`	`+ - BFS is optimal for finding the shortest path in an unweighted grid, which is why it is used after identifying the first island.`
	`120`	`+"""`

Comments

(0)