9. LESS IS MORE (BEAUTIFUL)
l = [ 3, 7, 8, 6, 5, 11 ]
q = []
for i in range( len(l) ):
q.insert( l[i] * 2 )
10. LESS IS MORE (BEAUTIFUL)
def dbl(x):
return x * 2
l = [ 3, 7, 8, 6, 5, 11 ]
q = []
for i in range( len(l) ):
q.insert( dbl (l[i]) )
11. LESS IS MORE (BEAUTIFUL)
def dbl(x):
return x * 2
l = [ 3, 7, 8, 6, 5, 11 ]
q = map( dbl, l )
12. LESS IS MORE (BEAUTIFUL)
l = [ 3, 7, 8, 6, 5, 11 ]
q = [ x * 2 for x in l ]
# Double only odd numbers? …
13. LESS IS MORE (BEAUTIFUL)
q = [ x * 2 for x in l if not (x % 2) ]
VS
q = map( lambda x : x * 2, filter(lambda y : y % 2 != 0, l ) )
14. ATTITUDE IS NO SUBSTITUTE FOR
COMPETENCE
O(n) = log n
VS
O(n) = n log n
15. KNOWING IS EVERYTHING
Insertion Sort (n^2) vs Merge Sort (n log(n))
Computer A 10,000 MIPS vs Computer B 10 MIPS
Number of items to be
Sorted
Insertion Sort or
Computer A
Merge Sort on
Computer B
10 Million
5.5 Hours
17 mins
100 Million
23 Days
4 hours