Skip to content
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
23 changes: 23 additions & 0 deletions boolean_algebra/array_complement.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
def array_complement(initial_lst: list, diff_lst: list) -> list:
"""
removes all values from list initial_lst which
are also present in list diff_lst [ while keeping
the initial order of the elements ]

https://en.wikipedia.org/wiki/Complement_(set_theory)

>>> array_complement([1, 6, 2, 8], [1, 4])
[6, 2, 8]
>>> array_complement([146], [146, 25])
[]
>>> array_complement([35], [36])
[35]


"""

return [c for c in initial_lst if c not in diff_lst]
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This doesn't look like boolean_algebra. This could be in array? if there's any update possible to existing code

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

thank you for the suggestion! sounds like a nice idea! would it be okay if i create a new "array" folder in the repo for this? or did you mean that there might be a smilar folder, which exists already, and i should add this algorithm to it? if so, could you please direct me to it?



if __name__ == "__main__":
__import__("doctest").testmod()