Reverse a list in haskell

You are separating the list into head and tail, but then re-assemble the list in the same order. Take the list [1, 2, 3] for example:

In the first call, x will be 1, and xs will be [2, 3]. Then you create a new list, consisting of x (so 1) at the front, followed by reverseList [2, 3].

Related Posts:

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

Leave a Comment