StukiMania
¬
±
·
×
÷
α
β
γ
δ
ε
ζ
η
θ
ι
κ
λ
μ
ν
ξ
ο
π
ρ
ς
σ
τ
υ
φ
χ
ψ
ω
¹
²
³

Maximum selection sort

Number of comparisons:
MC(n) = AC(n) = mC(n) = n*(n−1)/2 = Θ(n2)

Number of assignments:
MA(n) = (n2+7n)/2 - 4 = Θ(n2)
AA(n) = ?
mA(n) = 4*(n-1) = Θ(n)

As the maximum number of swaps is n-1, this algorithm is useful when swapping is an expensive task.