Haskell Merge Sort

This is an implementation of Mergesort using higher order functions,guards,where and recursion.

However getting an error from compiler 6:26: parse error on input ‘=’

 mergeSort :: ([a] -> [a] -> [a]) -> [a] -> [a]
    mergeSort merge xs
        | length xs < 2 = xs
        | otherwise = merge (mergeSort merge first) (mergeSort merge second)
        where first = take half xs 
              second = drop half xs 
               half = (length xs) `div` 2

I can’t see whats wrong? or rather I don’t understand the compiler.

Related Posts:

  1. Understanding the functions elem and isInfixOf
  2. Haskell – parse error on input `|’
  3. absolute values in Haskell
  4. Reverse a list in haskell
  5. Difference between `mod` and `rem` in Haskell
  6. How to fix “variable not in scope” error in GHCI?
  7. Division in Haskell
  8. What does the “Just” syntax mean in Haskell?
  9. How to split a string in Haskell?
  10. Haskell pattern matching – what is it?
  11. What does Cons and :-: mean in Haskell?
  12. Using map in Haskell
  13. Learning Haskell: How to remove an item from a List in Haskell
  14. Exactly how many comparisons does merge sort make?
  15. Why is the minimalist, example Haskell quicksort not a “true” quicksort?
  16. Merge sort time and space complexity
  17. Error haskell: not in scope. What does that mean?
  18. How do I use the filter function in Haskell?
  19. Haskell: Converting Int to String
  20. Insertion sort in Haskell
  21. How to sort in-place using the merge sort algorithm?
  22. Why is merge sort worst case run time O (n log n)?
  23. Why is merge sort worst case run time O (n log n)?

Leave a Comment