Edithistory:Ripple Sieve
From EverybodyWiki Bios & Wiki
| oldid | date/time | username | edit summary |
|---|---|---|---|
| 1334181909 | 2026-01-22T01:24:19Z | Dan arndt | Declining submission: v - Submission is improperly sourced and nn - Submission is about a topic not yet shown to meet general notability guidelines (be more specific if possible) |
| 1334172650 | 2026-01-22T00:00:39Z | DannyS712 bot | Task 3: Disable the categories on this page while it is still a draft, per [[WP:DRAFTNOCAT]]/[[WP:USERNOCAT]] |
| 1334169612 | 2026-01-21T23:34:58Z | Iuvrayan | /* Mathematical Recognition */ |
| 1334169413 | 2026-01-21T23:33:06Z | Iuvrayan | /* Comparison with Sieve of Sundaram */ |
| 1334168821 | 2026-01-21T23:28:28Z | Iuvrayan | /* Algorithm Description */ |
| 1334168218 | 2026-01-21T23:23:10Z | Iuvrayan | /* Algorithm Description */ |
| 1334167981 | 2026-01-21T23:21:03Z | Iuvrayan | /* Algorithm Description */ |
| 1334167778 | 2026-01-21T23:19:32Z | Iuvrayan | /* Algorithm Description */ |
| 1334167224 | 2026-01-21T23:14:43Z | Iuvrayan | /* Mathematical Recognition */ |
| 1334167142 | 2026-01-21T23:14:01Z | Iuvrayan | /* Overview */ |
| 1334167034 | 2026-01-21T23:13:02Z | Iuvrayan | /* Iterative Logic */ |
| 1334166667 | 2026-01-21T23:09:16Z | Iuvrayan | Submitting using [[WP:AFCSW|AfC-submit-wizard]] |
| 1334165768 | 2026-01-21T23:00:39Z | Iuvrayan | |
| 1334165256 | 2026-01-21T22:56:13Z | Iuvrayan | [[WP:AES|←]]Created page with '{{Draft article}} {{Infobox algorithm |name=Ripple Sieve |author=Rayan Ivaturi |class=[[Prime sieve]] |time_complexity=O(n log log n) |space_complexity=O(n) }} ==Overview== The '''Ripple Sieve''' is a [[prime sieve]] algorithm that generates all odd [[prime number]]s up to a given limit ''n''. Developed by Rayan Ivaturi, the algorithm is a variant of the [[Sieve of Eratosthenes]] that optimises the sieving process by focusing exclusively on odd integers an...' |
