Commit b2142b1

committed

fixed special characters

1 parent bf3a5cb commit b2142b1Copy full SHA for b2142b1

File tree

+10

-10

lines changed

+10

-10

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,10 +33,10 @@ We are not concerned about small values of n (i.e., anything to the left of n0).`
`33`	`33`
`34`	`34`	`* addition: the sum of two functions is governed by the dominant one`
`35`	`35`
`36`		`-O(f(n)) + O(g(n)) → O(max(f(n), g(n)))`
	`36`	`+O(f(n)) + O(g(n)) => O(max(f(n), g(n)))`
`37`	`37`
`38`	`38`	`* constant multiplication: can be ignored (if c>0)`
`39`	`39`
`40`	`40`	`* multiplication: both operands are important:`
`41`	`41`
`42`		`-O(f(n)) * O(g(n)) → O(f(n) * g(n))`
	`42`	`+O(f(n)) * O(g(n)) => O(f(n) * g(n))`

Lines changed: 8 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,20 +6,20 @@ title: 2.3 Growth Rates and Dominance Relations`
`6`	`6`	`## Growth rates`
`7`	`7`
`8`	`8`	`The growth rate of its time complexity functions can easily render an algorithm impractical even for relatively small inputs. Below are some complexity functions and the input ranges where they become unusable:`
`9`		`-`
`10`		`-* O(n!) ~ n ≥ 20`
`11`		`-`
	`9`	`+`
	`10`	`+* O(n!) ~ n > 20`
	`11`	`+`
`12`	`12`	`* O(2^n) ~ n > 40`
`13`		`-`
	`13`	`+`
`14`	`14`	`* O(n^2) ~ n > 100,000`
`15`		`-`
`16`		`-* O(n) and O(n lg n) ~ n > 1 bn`
`17`	`15`
`18`		`-* O(lg n) ~ any imaginable n`
	`16`	`+* O(n) and O(n lg n) ~ n > 1 bn`
	`17`	`+`
	`18`	`+* O(lg n) ~ any imaginable n`
`19`	`19`
`20`	`20`	`## Dominance relations`
`21`	`21`
`22`		`-* the Big Oh notation groups functions into a set of classes.`
	`22`	`+* the Big Oh notation groups functions into a set of classes.`
`23`	`23`	`* functions belonging to each class are considered equal with respect to Big Oh`
`24`	`24`	`* a faster-growing function class dominates a slower-growing one`
`25`	`25`

Comments

(0)