sieve.py

# Copyright (c) 2021, Oracle and/or its affiliates. All rights reserved.
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
#
# This code is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License version 2 only, as
# published by the Free Software Foundation.    Oracle designates this
# particular file as subject to the "Classpath" exception as provided
# by Oracle in the LICENSE file that accompanied this code.
#
# This code is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
# FITNESS FOR A PARTICULAR PURPOSE.    See the GNU General Public License
# version 2 for more details (a copy is included in the LICENSE file that
# accompanied this code).
#
# You should have received a copy of the GNU General Public License version
# 2 along with this work; if not, write to the Free Software Foundation,
# Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
#
# Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
# or visit www.oracle.com if you need additional information or have any
# questions.

# Used in the polybench harness as the default number of iterations for
# this benchmark.
def iterations():
    return 90

# Used in the polybench harness for aggregating the iteration datapoints.
def summary():
    return {
        "name": "OutlierRemovalAverageSummary",
        "lower-threshold": 0.1,
        "upper-threshold": 0.4,
    }

def run():
    number = 600000
    primes = list(range(0, number+1))

    i = 2
    while (i**2) <= number:
        if primes[i] != 0:
            for j in range(2, number):
                if primes[i] * j > number:
                    break
                else:
                    primes[primes[i] * j] = 0
        i += 1

    count = 0
    for c in range(2, number+1):
        if primes[c] != 0:
            count += 1

    __graalpython__.dump_heap()

    return count