Home / Questions / 28122
Accepted
Ramosaurio
Asked: 2020-10-17 01:41:40 +0800 CST 2020-10-17 01:41:40 +0800 CST

Sort tuple (a,a,a)

  • 772

Hi, I have the following tuple:

ordena :: Ord a => (a,a,a) -> (a,a,a)

Let's see this is not very complicated but as I do it I get a very ugly and long code.

In this case I ask to see if there is some type of recursion that I can do to order it from smallest to largest

haskell

2 Answers

  1. Best Answer

    Without using any modules (as I assume is desired), a straightforward and simple solution would be:

    ordena :: Ord a => (a,a,a) -> (a,a,a)
ordena (x,y,z) | x > y     = ordena (y,x,z)
               | y > z     = ordena (x,z,y)
               | otherwise = (x,y,z)
    • 2

  2. You can convert the tuple to a list, sort the list, and return the tuple:

    import Data.List(sort)
ordena :: Ord a => (a,a,a) -> (a,a,a)
ordena (a,b,c) = let [d,e,f] = sort [a,b,c] in (d,e,f)
    • 1