itertool

Author: PTHARRISH

Notes/itertools/combination.py

@@ -1,10 +1,13 @@
 # Combinations()
 # The combinations() function in Python, part of the itertools module,
-# is used to generate all possible combinations of a specified length from a given iterable
+# is used to generate all possible combinations of a specified length 
+# from a given iterable
 # (like a list, string, or tuple).
 # Unlike permutations, where the order does matter,
-# combinations focus only on the selection of elements, meaning the order does not matter.
-# It returns an iterator producing tuples, each representing a unique combination of the input elements.
+# combinations focus only on the selection of elements, 
+# meaning the order does not matter.
+# It returns an iterator producing tuples, 
+# each representing a unique combination of the input elements.
 
 
 # Example:
@@ -27,13 +30,17 @@
 # itertools.combinations()
 # generates all unordered pairs (length = 2) from the string "GeEK".
 # Each element is treated by its position and value.
-# The order within each tuple doesn't matter and no duplicate combinations (like ('e', 'G')) are included.
+# The order within each tuple doesn't matter and 
+# no duplicate combinations (like ('e', 'G')) are included.
 
 # Syntax of Itertools.Combinations()
 # itertools.combinations(iterable, r)
 
 # Parameters:
 
-# iterable: The input sequence (list, string, tuple, etc.) from which combinations are formed.
+# iterable: The input sequence (list, string, tuple, etc.) 
+# from which combinations are formed.
 # r: The length of each combination to be generated.
-# Returns: An iterator that produces tuples, each representing a unique combination of r elements from the iterable, in the order they appear.
+# Returns: An iterator that produces tuples, 
+# each representing a unique combination of r elements from the iterable, 
+# in the order they appear.

Notes/itertools/permutations.py

@@ -1,9 +1,11 @@
 # Itertools.permutation()
 # Itertools.permutation() function falls under the Combinatoric Generators.
-# The recursive generators that are used to simplify combinatorial constructs such as permutations, combinations,
+# The recursive generators that are used to simplify combinatorial constructs 
+# such as permutations, combinations,
 # and Cartesian products are called combinatoric iterators
 
-# The word “Permutation” it refers to all the possible combinations in which a set or string can be ordered or arranged.
+# The word “Permutation” it refers to all the possible combinations 
+# in which a set or string can be ordered or arranged.
 # Similarly here itertool.permutations() method provides us with all the possible arrangements
 # that can be there for an iterator and all elements are assumed to be unique on the basis of their position
 # and not by their value or category.
@@ -27,6 +29,32 @@
 for i in list(p):
     print(i)  # print each value inside the permutation object
 
+# Example:
+
+# ('H', 'A', 'S', 'H')
+# ('H', 'A', 'H', 'S')
+# ('H', 'S', 'A', 'H')
+# ('H', 'S', 'H', 'A')
+# ('H', 'H', 'A', 'S')
+# ('H', 'H', 'S', 'A')
+# ('A', 'H', 'S', 'H')
+# ('A', 'H', 'H', 'S')
+# ('A', 'S', 'H', 'H')
+# ('A', 'S', 'H', 'H')
+# ('A', 'H', 'H', 'S')
+# ('A', 'H', 'S', 'H')
+# ('S', 'H', 'A', 'H')
+# ('S', 'H', 'H', 'A')
+# ('S', 'A', 'H', 'H')
+# ('S', 'A', 'H', 'H')
+# ('S', 'H', 'H', 'A')
+# ('S', 'H', 'A', 'H')
+# ('H', 'H', 'A', 'S')
+# ('H', 'H', 'S', 'A')
+# ('H', 'A', 'H', 'S')
+# ('H', 'A', 'S', 'H')
+# ('H', 'S', 'H', 'A')
+# ('H', 'S', 'A', 'H')
 
 # Example:
 print("All the permutations of the given list is:")
@@ -46,7 +74,8 @@
 
 
 print("All the permutations of the given container is:")
-print(list(permutations(range(3), 2)))  # 2 is r -> refers to the length or dimension
+print(list(permutations(range(3), 2)))  
+# 2 is r -> refers to the length or dimension
 
 # If r and length is mentioned here the output is
 # All the permutations of the given container is (range(3), 2):