Commit994c1f2

authored

Tenses.

1 parentc1cccdd commit994c1f2Copy full SHA for 994c1f2

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -140,7 +140,7 @@ This paradigm is widely used in tasks around trees, such as finding lowest commo`
`140`	`140`
`141`	`141`	`##Parallel Binary Search`
`142`	`142`
`143`		`-<small>Note that this sectionis following the description in[Sports programming in practice](https://kostka.dev/sp/).</small>`
	`143`	`+<small>Note that this sectionfollows the description in[Sports programming in practice](https://kostka.dev/sp/).</small>`
`144`	`144`
`145`	`145`	`Imagine that we want to answer $Z$ queries about the index of the largest value less than or equal to some $X_i$ (for $i=1,2,\ldots,Z$) in some sorted 0-indexed array $A$. Naturally, each query can be answered using binary search.`
`146`	`146`

Comments

(0)