Loading…

Prime Numbers Comparison using Sieve of Eratosthenes and Sieve of Sundaram Algorithm

Prime numbers are numbers that have their appeal to researchers due to the complexity of these numbers, many algorithms that can be used to generate prime numbers ranging from simple to complex computations, Sieve of Eratosthenes and Sieve of Sundaram are two algorithm that can be used to generate P...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2018-03, Vol.978 (1), p.12123
Main Authors: Abdullah, D, Rahim, R, Apdilah, D, Efendi, S, Tulus, T, Suwilo, S
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Prime numbers are numbers that have their appeal to researchers due to the complexity of these numbers, many algorithms that can be used to generate prime numbers ranging from simple to complex computations, Sieve of Eratosthenes and Sieve of Sundaram are two algorithm that can be used to generate Prime numbers of randomly generated or sequential numbered random numbers, testing in this study to find out which algorithm is better used for large primes in terms of time complexity, the test also assisted with applications designed using Java language with code optimization and Maximum memory usage so that the testing process can be simultaneously and the results obtained can be objective
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/978/1/012123