Insertion sort in Haskell

insert x insertionSort xs

is calling insert with three arguments (x,insertionSort,xs). Probably you want

insert x (insertionSort xs)

Related Posts:

  1. What does Cons and :-: mean in Haskell?
  2. Haskell pattern matching – what is it?
  3. Reverse a list in haskell
  4. How to use filter, map, and reduce in Python 3
  5. What is tail recursion?
  6. map function for objects (instead of arrays)
  7. How does functools partial do what it does?
  8. Understanding the functions elem and isInfixOf
  9. Does JavaScript have a method like “range()” to generate a range within the supplied bounds?
  10. How to sort with lambda in Python
  11. Does JavaScript have a method like “range()” to generate a range within the supplied bounds?
  12. What is difference between functional and imperative programming languages?
  13. What’s the difference between lapply and do.call?
  14. What is polymorphism in Javascript?
  15. Using map in Haskell
  16. Learning Haskell: How to remove an item from a List in Haskell
  17. Haskell – parse error on input `|’
  18. In R, getting the following error: “attempt to replicate an object of type ‘closure'”
  19. Why is the minimalist, example Haskell quicksort not a “true” quicksort?
  20. Error haskell: not in scope. What does that mean?
  21. What is the difference between procedural programming and functional programming?
  22. absolute values in Haskell
  23. How do I use the filter function in Haskell?
  24. Haskell: Converting Int to String
  25. Haskell Merge Sort
  26. What tools are there for functional programming in C?
  27. Difference between `mod` and `rem` in Haskell
  28. How to fix “variable not in scope” error in GHCI?
  29. .filter is not a function 
  30. Division in Haskell
  31. What does the “Just” syntax mean in Haskell?
  32. How to split a string in Haskell?

Leave a Comment