MITTutorialApril2009: SortExercise.fss

component SortExercise
export Executable

import List.{...}
import Shuffle.{...}

sort(a: List[\ZZ32\]): List[\ZZ32\] =
    fail("You still need to implement a sort function.")

run(): () = do
    emptylist = <|[\ZZ32\] |>
    zero = <|[\ZZ32\] 0 |>
    zeroes = <|[\ZZ32\] 0 | _ <- 0#10 |>
    zeroOne = <|[\ZZ32\] 0, 1 |>
    oneZero = <|[\ZZ32\] 1, 0 |>
    lots = <|[\ZZ32\] i | i <- 0#100 |>
    shuffled = shuffle(lots)
    doubled = lots || lots
    doubleshuffled = shuffle(doubled)
    sortedDoubled = <|[\ZZ32\] i | i <- lots, _ <- 0#2 |>
    assert(emptylist, sort(emptylist))
    assert(zero, sort(zero))
    assert(zeroOne, sort(zeroOne))
    assert(zeroOne, sort(oneZero))
    assert(lots, sort(lots))
    assert(sortedDoubled, sort(doubled))
    assert(sortedDoubled, sort(doubleshuffled))
    println("Your sort appears to work.")
  end

end