Difference between revisions of "User talk:Marcelo.parrela"

From HaskellWiki
Jump to navigation Jump to search
(Quicksort - An other Implementation)
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
  +
== Quicksort - An other Implementation ==
  +
 
<pre>
 
<pre>
 
-- by Marcelo Parrela (marcelo.parrela@gmail.com)
 
-- by Marcelo Parrela (marcelo.parrela@gmail.com)
Line 8: Line 10:
 
separate [] _ a b = (a,b)
 
separate [] _ a b = (a,b)
 
separate (l:ls) a l1 l2
 
separate (l:ls) a l1 l2
| l <= a = separate ls a l1' l2
+
| l &lt;= a = separate ls a l1' l2
 
| otherwise = separate ls a l1 l2'
 
| otherwise = separate ls a l1 l2'
 
where
 
where
 
l1' = l1++[l]
 
l1' = l1++[l]
 
l2' = l2++[l]
 
l2' = l2++[l]
  +
 
</pre>
 
</pre>

Latest revision as of 12:21, 14 October 2013

Quicksort - An other Implementation

-- by Marcelo Parrela (marcelo.parrela@gmail.com)
quicksort' []  = []
quicksort' (a:as) = quicksort' l1 ++ a : quicksort' l2 
    where
        (l1,l2) = separate as a [] []

        separate [] _ a b = (a,b)
        separate (l:ls) a l1 l2
            | l <= a    = separate ls a l1' l2
            | otherwise = separate ls a l1 l2'
            where
                l1' = l1++[l]
                l2' = l2++[l]