Splitting a list of items into two lists of odd and even indexed items

by

Implementation which does not stack-overflows:

let splitList list = List.foldBack (fun x (l,r) -> x::r, l) list ([],[])

More Related Contents:

  1. Zip with default value instead of dropping values?
  2. How to cast an object to a list of generic type in F#
  3. Merging two lists in Haskell
  4. Linked list partition function and reversed results
  5. While or Tail Recursion in F#, what to use when?
  6. Removing syntactic sugar: List comprehension in Haskell
  7. Prolog union for A U B U C
  8. How to check if all of the following items are in a list?
  9. How do I append lists in Prolog?
  10. What is Haskell’s Stream Fusion
  11. Using return vs. not using return in the list monad
  12. Cartesian product of infinite lists in Haskell
  13. Hide Show content-list with only CSS, no javascript used
  14. Get number of items from list (or other iterable) with certain condition
  15. Subsets in Prolog
  16. Recombining a list of Data.frames into a single data frame [duplicate]
  17. How do I split or chunk a list into equal parts, with Dart?
  18. What is the most efficient way to cast a list as a data frame?
  19. Tail recursive function to find depth of a tree in Ocaml
  20. “bad words” filter [closed]
  21. How to extend a Scala list to enable slicing not by explicit position but by given predicate/condition
  22. Haskell Monad – How does Monad on list work?
  23. Iterate over pairs in a list (circular fashion) in Python
  24. Python recursive function to display all subsets of given set
  25. Erlang lists with single numbers over 8?
  26. F# development and unit testing? [closed]
  27. Why does OCaml sometimes require eta expansion?
  28. Pythonic way to convert a list of integers into a string of comma-separated ranges
  29. Implementing “last” in Prolog
  30. Slicing a list into a list of sub-lists [duplicate]

Leave a Comment