Commit 6ac926f

authored

Update Readme.md

1 parent 6cd7966 commit 6ac926fCopy full SHA for 6ac926f

File tree

-6

lines changed

-6

lines changed

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,13 +5,13 @@ We start from 2, initially all numbers upto N unmarked.Then , if a number is unm`
`5`	`5`
`6`	`6`	`## Pseudo Code`
`7`	`7`
`8`		`-1. Take an array , arr[N] = {0} //All unmarked`
	`8`	`+1. Take an array , arr[N] = {0} //All unmarked`
`9`	`9`	`2. Run Loop, for i from 2 to square_root(N) :`
`10`		`-3. if arr[i] equals 0 :`
`11`		`-4. Run Loop, for j from 2 to N :`
`12`		`-5. if i*j > N :`
`13`		`-6. ( Break this Loop )`
`14`		`-7. arr[i*j] = 1 // Every multiple is marked composite`
	`10`	`+3. if arr[i] equals 0 :`
	`11`	`+4. Run Loop, for j from 2 to N :`
	`12`	`+5. if i*j > N :`
	`13`	`+6. ( Break this Loop )`
	`14`	`+7. arr[i*j] = 1 // Every multiple is marked composite`
`15`	`15`
`16`	`16`	`## Problems with this method`
`17`	`17`

Comments

(0)