You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: C++/Algorithms/Randomized-Algorithms/readme.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -4,4 +4,4 @@
4
4
5
5
As a coloring algorithm, when you use an app such as Paint, press the fill button and press a shape, and the color is colored inside the shape. Likewise in the case of minesweeper, when you click a non-mines part, all parts of the surrounding area without mines are pressed. This algorithm is called a flood-fill algorithm.
6
6
7
-
Time complexity => O(N^2) (N reprsent length of the side of a square)
7
+
Time complexity = O(N^2) (N reprsent length of the side of a square)
0 commit comments