From ef234d5e75d83e98f14c0009fa9bd18404e28bfe Mon Sep 17 00:00:00 2001 From: Eric Douglas Date: Thu, 22 May 2014 19:22:13 -0300 Subject: [PATCH] filter pattern in 1.1.3 --- .../UNIT-01/03-problem-solving/.loops.py.swp | Bin 12288 -> 12288 bytes .../UNIT-01/03-problem-solving/loops.py | 10 ++++++++++ 2 files changed, 10 insertions(+) diff --git a/archives/01-introduction-to-computer-science-and-programming/archives/UNIT-01/03-problem-solving/.loops.py.swp b/archives/01-introduction-to-computer-science-and-programming/archives/UNIT-01/03-problem-solving/.loops.py.swp index c3b1bfc812a84605543210e52cba48e3bbb46952..fc664f1e430fb12dbc3b87616ed31319845d80a8 100644 GIT binary patch delta 387 zcmYL@u}T9$5QgVagd|8Vl^_;_5y|Nh5-fy(a)lNaf}jW*4zgb6&V^(z>@6WSn##uV z9>CU0koXkA2M`3`LF_EVG3VjH$1==Q%N|XwK1_t$#y5LBLe+(vYW&oJ56I1{I diff --git a/archives/01-introduction-to-computer-science-and-programming/archives/UNIT-01/03-problem-solving/loops.py b/archives/01-introduction-to-computer-science-and-programming/archives/UNIT-01/03-problem-solving/loops.py index fdd6486..1289a1e 100644 --- a/archives/01-introduction-to-computer-science-and-programming/archives/UNIT-01/03-problem-solving/loops.py +++ b/archives/01-introduction-to-computer-science-and-programming/archives/UNIT-01/03-problem-solving/loops.py @@ -51,4 +51,14 @@ def find(target, items): return True return False +# The extreme pattern +largest = items[0] +for i in range(1, len(items), 1): # start comparing at index 1 + if items[i] > largest: + largest = items[i] +# The filter pattern +def extractEvens(items): + for i in range(0, len(items), 1): + if (isEven(items[i])): + evens = evens + [items[i]] # array concatenation