Commitc748a22

authored

Merge pull request#1519 from aleksmish/patch-3

fix typo

2 parentsd4d57e9 +5b0f90a commitc748a22Copy full SHA for c748a22

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ The naive solution algorithm is to iterate over all pairs of segments in $O(n^2)`
`14`	`14`	`##Algorithm`
`15`	`15`
`16`	`16`	`Let's draw a vertical line $x = -\infty$ mentally and start moving this line to the right.`
`17`		`-In the course of its movement, this line will meet with segments, and at each time a segmentintersect with our line it intersects in exactly one point (we will assume that there are no vertical segments).`
	`17`	`+In the course of its movement, this line will meet with segments, and at each time a segmentintersects with our line it intersects in exactly one point (we will assume that there are no vertical segments).`
`18`	`18`
`19`	`19`	`<divstyle="text-align:center;">`
`20`	`20`	`<imgsrc="sweep_line_1.png"alt="sweep line and line segment intersection">`

Comments

(0)