← All examples

Primality test

Go Algorithms

loop with early return

Flowchart (ISO 5807)

YesNoYesNoStartInput nn < 2Return falseEndi = 2, i*i <= n, i++n%i == 0Return falseEndReturn trueEndFigure 1 — isPrime

Source code

func isPrime(n int) bool {
    if n < 2 {
        return false
    }
    for i := 2; i*i <= n; i++ {
        if n%i == 0 {
            return false
        }
    }
    return true
}