File:Sieve of Sundaram Animated.gif
Jump to navigation
Jump to search
No higher resolution available.
Sieve_of_Sundaram_Animated.gif (455 × 284 pixels, file size: 63 KB, MIME type: image/gif, looped, 256 frames, 29 s)
Note: Due to technical limitations, thumbnails of high resolution GIF images such as this one will not be animated.
Summary
| Description |
English: Animation that visualizes the "Sieve of Sundaram" algorithm.
The Sieve of Sundaram is an algorithm for finding all prime numbers up to a specified integer. One starts with a list of integers 1 to n. From the list, numbers of the form i + j + 2ij where 1 <= i <= j and i + j + 2ij <= n are removed. The remaining numbers in the list are then doubled and incremented by one. Various optimizations of the algorithm exist, but this visualization shows the verbatim, unoptimized implementation. This visualization is inspired by Sebastian Koppehel's visualization of the Sieve of Eratosthenes (link). |
| Date | |
| Source | Own work |
| Author | RedStar24 |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 23:37, 7 April 2014 | | 455 × 284 (63 KB) | wikimediacommons>RedStar24 | Crisper and smaller image |
File usage
The following page uses this file:
