I am trying to solve the prefix ordering problem in Haskell. This fib function suppose to take a list and make its largest element placed at the end of the list. It gives a
