clean up

Author: Mia Steinkirch

First_edition_2014/README.md

@@ -0,0 +1,14 @@
+## Python & Algorithms Book 1st Edition (2014, a published by Hanbit Media)
+
+➡️ 📚[Download PDF (first edition)](https://github.com/bt3gl/Python-and-Algorithms-and-Data-Structures/blob/master/First_edition_2014/ebook_pdf/book_second_edition.pdf).
+
+
+## Installation:
+
+Install dependencies in a [virtual environment](https://coderwall.com/p/8-aeka):
+
+```
+virtualenv venv
+source venv/bin/activate
+pip install -r requirements.txt
+```

First_edition_2014/ebook_pdf/book_second_edition.pdf

@@ -0,0 +1,18 @@
+#!/usr/bin/env python3
+
+__author__ = "bt3"
+
+
+from functools import lru_cache
+
+
+@lru_cache(maxsize=20)
+def fib(n):
+    if n < 2:
+        return n
+    return fib(n-1) + fib(n-2)
+
+
+if __name__ == '__main__':
+    print([fib(n) for n in range(10)])
+    print(fib.cache_info())

First_edition_2014/ebook_src/USEFUL/advanced/lru_cache.py

@@ -0,0 +1,31 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+from collections import OrderedDict
+
+def  OrderedDict_example():
+    ''' show some examples for OrderedDict '''
+    ''' keep the order of insertion.
+        maintains a doubly linked list, so size is more than twice than normal dict'''
+
+
+    pairs = [('a', 1), ('b',2), ('c',3)]
+
+    d1 = {}
+    for key, value in pairs:
+        if key not in d1:
+            d1[key] = []
+        d1[key].append(value)
+    for key in d1:
+        print(key, d1[key])
+
+    d2 = OrderedDict(pairs)
+    for key in d2:
+        print(key, d2[key])
+
+
+if __name__ == '__main__':
+    OrderedDict_example()
+
+

First_edition_2014/ebook_src/USEFUL/basic_examples/example_OrderedDict.py

@@ -0,0 +1,17 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+def simple2(a, *args):
+    print args
+
+def simple(*args):
+    print args
+
+def simple3(**kwargs):
+    print kwargs
+
+
+simple(1, 2, 3)
+simple2(1, 2, 3)
+simple3(x=1, y=2)

First_edition_2014/ebook_src/USEFUL/basic_examples/example_args.py

@@ -0,0 +1,28 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+
+import random
+
+def benchmark(func):
+    import time
+    def wrapper(*args, **kwargs):
+        t = time.clock()
+        res = func(*args, **kwargs)
+        print("\t%s" % func.__name__, time.clock()-t)
+        return res
+    return wrapper
+
+
+@benchmark
+def random_tree(n):
+    temp = [n for n in range(n)]
+    for i in range(n+1):
+        temp[random.choice(temp)] = random.choice(temp)
+    return temp
+
+
+if __name__ == '__main__':
+    random_tree(10000)
+

First_edition_2014/ebook_src/USEFUL/basic_examples/example_benchmark_decorator.py

@@ -0,0 +1,37 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+a = [3, 4, 5, 6, 7]
+
+
+# Filter elements greater than 4
+
+# Bad:
+
+b = []
+for i in a:
+    if i > 4:
+        b.append(i)
+print b
+
+# Good:
+print [i for i in a if i > 4]
+
+# Or:
+print filter(lambda x: x > 4, a)
+
+
+# Add three to all list members:
+
+# Bad
+b = []
+for i in range(len(a)):
+    b.append(a[i] + 3)
+print b
+
+# Good:
+print [i + 3 for i in a]
+
+# Or:
+print map(lambda i: i + 3, a)

First_edition_2014/ebook_src/USEFUL/basic_examples/example_comp_lists.py

@@ -0,0 +1,32 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+from collections import Counter
+
+def  Counter_example():
+    ''' it is a dictionary that maps the items to the number of occurrences '''
+    seq1 = [1, 2, 3, 5, 1, 2, 5, 5, 2, 5, 1, 4]
+    seq_counts = Counter(seq1)
+    print(seq_counts)
+
+    ''' we can increment manually or use the update() method '''
+    seq2 = [1, 2, 3]
+    seq_counts.update(seq2)
+    print(seq_counts)
+
+    seq3 = [1, 4, 3]
+    for key in seq3:
+        seq_counts[key] += 1
+    print(seq_counts)
+
+    ''' also, we can use set operations such as a-b or a+b '''
+    seq_counts_2 = Counter(seq3)
+    print(seq_counts_2)
+    print(seq_counts + seq_counts_2)
+    print(seq_counts - seq_counts_2)
+
+if __name__ == '__main__':
+    Counter_example()
+
+

First_edition_2014/ebook_src/USEFUL/basic_examples/example_counter.py

@@ -0,0 +1,42 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+
+
+def logger(func):
+    def inner(*args): #1
+        print "Arguments were: {0}".format(args)
+        return func(*args)
+    return inner
+
+@logger
+def foo(x, y):
+    return x+y
+
+print foo(1, 2)
+
+
+def sum(func):
+    s = 0
+    for i in func():
+        s += i
+    return s
+
+@sum
+def interate():
+    a = []
+    for i in range(10):
+        a.append(i)
+    return a
+
+print interate
+
+# which is the same as
+def interate():
+    a = []
+    for i in range(10):
+        a.append(i)
+    return a
+
+print sum(interate)

First_edition_2014/ebook_src/USEFUL/basic_examples/example_decorators.py

@@ -0,0 +1,27 @@
+#!/usr/bin/env python
+
+__author__ = "bt3"
+
+from collections import defaultdict
+
+def  defaultdict_example():
+    ''' show some examples for defaultdicts '''
+    pairs = {('a', 1), ('b',2), ('c',3)}
+
+    d1 = {}
+    for key, value in pairs:
+        if key not in d1:
+            d1[key] = []
+        d1[key].append(value)
+    print(d1)
+
+    d2 = defaultdict(list)
+    for key, value in pairs:
+        d2[key].append(value)
+    print(d2)
+
+
+if __name__ == '__main__':
+    defaultdict_example()
+
+