Juliaを試してみた

みなさんお久しぶりです。mk419です。今回は速いと噂のJuliaを試してみたいと思います。

テスト用のコード

最大値(stop)までの素数を出力するプログラムです。なんも最適化してません。

Python

#!/usr/bin/env python3
import sys

def get_prime_numbers(stop: int) -> None:
    prime_numbers: list[int] = []

    for number in range(2, stop + 1):
        for prime_number in prime_numbers:
            if number % prime_number == 0:
                break
        else:
            print(number)
            prime_numbers.append(number)


if __name__ == "__main__":
    get_prime_numbers(int(sys.argv[1]))

Nim

import os
import strutils

proc getPrimeNumbers(stop: int) =
    var
        prime_numbers: seq[int] = @[]
        continueFlag = false

    for number in 2..stop:
        for prime_number in prime_numbers:
            if number mod prime_number == 0:
                continueFlag = true
                break
        
        if continueFlag:
            continueFlag = false
            continue

        echo number
        prime_numbers.add(number)


if isMainModule:
    getPrimeNumbers(commandLineParams()[0].parseInt())

Julia

function get_prime_numbers(stop::Int)
    prime_numbers = []
    continue_flag = false

    for number = 2:stop
        for prime_number in prime_numbers
            if number % prime_number == 0
                continue_flag = true
                break
            end
        end

        if continue_flag
            continue_flag = false
            continue
        end

        println(number)
        push!(prime_numbers, number)
    end
end


if abspath(PROGRAM_FILE) == @__FILE__
    get_prime_numbers(parse(Int, ARGS[1]))
end