app Quicksort 
    provides [ quicksort ]
    imports [ Utils.{swap} ]


quicksort : List Int -> List Int
quicksort = \originalList -> 
    quicksortHelp : List (Num a), Int, Int -> List (Num a)
    quicksortHelp = \list, low, high ->
        if low < high then
            when partition low high list is
                Pair partitionIndex partitioned ->
                    partitioned
                        |> quicksortHelp low (partitionIndex - 1)
                        |> quicksortHelp (partitionIndex + 1) high
        else
            list

    partition : Int, Int, List (Num a) -> [ Pair Int (List (Num a)) ]
    partition = \low, high, initialList ->
        when List.get initialList high is
            Ok pivot ->
                when partitionHelp (low - 1) low initialList high pivot is
                    Pair newI newList ->
                        Pair (newI + 1) (Utils.swap (newI + 1) high newList)

            Err _ ->
                Pair (low - 1) initialList


    partitionHelp : Int, Int, List (Num a), Int, (Num a) -> [ Pair Int (List (Num a)) ]
    partitionHelp = \i, j, list, high, pivot ->
        if j < high then
            when List.get list j is
                Ok value ->
                    if value <= pivot then
                        partitionHelp (i + 1) (j + 1) (Utils.swap (i + 1) j list) high pivot
                    else
                        partitionHelp i (j + 1) list high pivot

                Err _ ->
                    Pair i list
        else
            Pair i list



    n = List.len originalList 
    quicksortHelp originalList 0 (n - 1)