Splitting a list of integers into a list of positive integers and a list of negative integers

by

The recursive part is not quite correct.

split([], [], []).
split([Head|Tail], [Head|List1], List2) :- Head>=0, split(Tail, List1, List2).
split([Head|Tail], List1, [Head|List2]) :- Head<0, split(Tail, List1, List2).

The Head should be added to the positive list if Head >= 0 and to the negative list when Head < 0.

Moreover, checking the sign of Head at the beginning is better, because it will prevent unnecessary recursive calls.

More Related Contents:

  1. Find powers of 2 in a list Prolog
  2. prolog change show answer to print into list
  3. Prolog union for A U B U C
  4. Prolog – count repetitions in list
  5. Prolog removing unique elements only
  6. Flatten a list in Prolog
  7. How do I append lists in Prolog?
  8. Prolog: Filtering a list?
  9. Remove duplicates in list (Prolog)
  10. Subsets in Prolog
  11. Get elements from list of lists
  12. Lazy lists in Prolog?
  13. How do I split or chunk a list into equal parts, with Dart?
  14. Segregating Lists in Prolog
  15. How to count number of element occurrences in a list in Prolog
  16. Intersection and union of 2 lists
  17. Prolog: First duplicate value
  18. Implementing “last” in Prolog
  19. Recursive Prolog predicate for reverse / palindrome
  20. Prolog, find minimum in a list
  21. Split a string by a delimiter in python
  22. Convert a Scala list to a tuple?
  23. data.frame rows to a list
  24. How to create an Object that outputs a List (Not A Table)
  25. How to convert a matrix to a list of column-vectors in R?
  26. How to split strings inside a list by whitespace characters
  27. How to transform string of space-separated key,value pairs of unique words into a dict
  28. How to cast an object to a list of generic type in F#
  29. rbind dataframes in a list of lists
  30. Grouping a list into lists of n elements in Haskell

Leave a Comment