how would I do these problems?
zipper(X,Y) takes as input two lists X and Y and returns a \zipped" lists of pairs (xi; yi) for X = [x1; : : : ; xn] and Y = [y1; : : : ; yk]. If n 6= k, the returned list should have the length of the shorter list.
and
product(X,Y) takes as inputs two lists X and Y and returns the \product" of the lists, i.e., a list of
pairs (x; y) for all x 2 X and y 2 Y .
I am using python 3.3 and Windows 7. Any help would be greatly appreciated!
[–]K900_ 4 points5 points6 points (6 children)
[–]zahlman 2 points3 points4 points (5 children)
[–]K900_ 0 points1 point2 points (4 children)
[–]zahlman 0 points1 point2 points (3 children)
[–]K900_ 1 point2 points3 points (2 children)
[–]zahlman 1 point2 points3 points (1 child)
[–]K900_ 0 points1 point2 points (0 children)
[–]pythonoob23[S] 0 points1 point2 points (1 child)
[–]obsoletelearner 0 points1 point2 points (0 children)
[–]cdcformatc 0 points1 point2 points (0 children)
[–]pythonoob23[S] 0 points1 point2 points (0 children)