I am trying to implement a very trivial sorting algorithm in Haskell. It compiles but keeps giving me incorrect outputs.

Here is the code

```
import Data.List

minimum' :: (Ord a) => [a] -> a
minimum' (x:xs) = foldr (\ x y -> if x <= y then x else y) x xs

qsrt :: (Ord a) => [a] -> [a]
qsrt [] = []
qsrt l@(x:xs) = minimum' l : qsrt xs

```

Any thoughts?