sorted by: recent | see : popular

Content Tagged with algorithms + haskell

"to get the "flavor" of denotational semantics, consider this proof of the correctness of the quicksort in Haskell, by structural induction:"

When working with sorted lists you often come to the point where you want to combine two or more of them. This merge procedure forms the heart of merge sort it works something like:

Very conscise solution of the problem