Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit5f18393

Browse files
committed
Tiny latex fix
1 parentd6a9dc5 commit5f18393

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎src/geometry/nearest_points.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -352,7 +352,7 @@ While this algorithm may look slow, because of recomputing everything multiple t
352352
353353
We can therefore see that the expected cost is
354354
355-
$$O\left(n + \sum_{i=1}^{n} i \Pr(X_i = 1)\right) \le O\left(n + \sum_{i=1}^{n} i \frac{2}{i}\right) = O(3n) = O(n) \quad \quad \blacksquare$$
355+
$$O\!\left(n + \sum_{i=1}^{n} i \Pr(X_i = 1)\right) \le O\!\left(n + \sum_{i=1}^{n} i \frac{2}{i}\right) = O(3n) = O(n) \quad \quad \blacksquare$$
356356
357357
358358
## Generalization: finding a triangle with minimal perimeter

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp