Fixes #141: removes support for python 2

Author: VikingScientist

chapters/euclidean_algorithm/code/python/euclidean_example.py

@@ -1,6 +1,3 @@
-from __future__ import print_function
-
-
 def euclid_mod(a, b):
 
     a = abs(a)

chapters/euclidean_algorithm/euclidean.md

@@ -16,7 +16,7 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
 {% sample lang="js" %}
 [import:15-29, lang="javascript"](code/javascript/euclidean_example.js)
 {% sample lang="py" %}
-[import:17-28, lang="python"](code/python/euclidean_example.py)
+[import:14-25, lang="python"](code/python/euclidean_example.py)
 {% sample lang="haskell" %}
 [import:3-11, lang="haskell"](code/haskell/euclidean_example.hs)
 {% sample lang="rs" %}
@@ -47,7 +47,7 @@ Modern implementations, though, often use the modulus operator (%) like so
 {% sample lang="js" %}
 [import:1-13, lang="javascript"](code/javascript/euclidean_example.js)
 {% sample lang="py" %}
-[import:4-15, lang="python"](code/python/euclidean_example.py)
+[import:1-12, lang="python"](code/python/euclidean_example.py)
 {% sample lang="haskell" %}
 [import:13-24, lang="haskell"](code/haskell/euclidean_example.hs)
 {% sample lang="rs" %}

chapters/sorting_searching/bubble/bubble_sort.md

@@ -17,7 +17,7 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 {% sample lang="js" %}
 [import:1-11, lang:"javascript"](code/js/bubble.js)
 {% sample lang="py" %}
-[import:5-10, lang:"python"](code/python/bubblesort.py)
+[import:4-9, lang:"python"](code/python/bubblesort.py)
 {% sample lang="hs" %}
 [import, lang:"haskell"](code/haskell/bubbleSort.hs)
 {% sample lang="cpp" %}

chapters/sorting_searching/bubble/code/python/bubblesort.py

@@ -1,4 +1,3 @@
-from __future__ import print_function
 import random
 
 

chapters/tree_traversal/code/python/Tree_example.py

@@ -1,6 +1,3 @@
-from __future__ import print_function
-
-
 class Node:
 
     def __init__(self):

chapters/tree_traversal/tree_traversal.md

@@ -15,7 +15,7 @@ Trees are naturally recursive data structures, and because of this, we cannot ac
 This has not been implemented in your chosen language, so here is the Julia code
 [import:3-7, lang:"julia"](code/julia/Tree.jl)
 {% sample lang="py" %}
-[import:4-8, lang:"python"](code/python/Tree_example.py)
+[import:1-5, lang:"python"](code/python/Tree_example.py)
 {% sample lang="scratch" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:3-7, lang:"julia"](code/julia/Tree.jl)
@@ -39,7 +39,7 @@ Because of this, the most straightforward way to traverse the tree might be recu
 {% sample lang="js" %}
 [import:15-23, lang:"javascript"](code/javascript/Tree_example.js)
 {% sample lang="py2" %}
-[import:10-18, lang:"python"](code/python/Tree_example.py)
+[import:7-15, lang:"python"](code/python/Tree_example.py)
 {% sample lang="py3" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:9-16, lang:"julia"](code/julia/Tree.jl)
@@ -155,7 +155,7 @@ In code, it looks like this:
 {% sample lang="js" %}
 [import:25-40, lang:"javascript"](code/javascript/Tree_example.js)
 {% sample lang="py" %}
-[import:27-38, lang:"python"](code/python/Tree_example.py)
+[import:24-35, lang:"python"](code/python/Tree_example.py)
 {% sample lang="scratch" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:45-56, lang:"julia"](code/julia/Tree.jl)
@@ -186,7 +186,7 @@ And this is exactly what Breadth-First Search (BFS) does! On top of that, it can
 {% sample lang="js" %}
 [import:42-57, lang:"javascript"](code/javascript/Tree_example.js)
 {% sample lang="py" %}
-[import:40-51, lang:"python"](code/python/Tree_example.py)
+[import:37-48, lang:"python"](code/python/Tree_example.py)
 {% sample lang="scratch" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:58-69, lang:"julia"](code/julia/Tree.jl)