From 137b24018e986f2f34a15d708b12a1839845b442 Mon Sep 17 00:00:00 2001
From: Mukundan <30190448+Mukundan314@users.noreply.github.com>
Date: Thu, 28 Jun 2018 22:08:38 +0530
Subject: [PATCH] Add bubble_sort.py to bubble_sort.md

---
 .../sorting_searching/bubble/bubble_sort.md   | 20 +++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/chapters/sorting_searching/bubble/bubble_sort.md b/chapters/sorting_searching/bubble/bubble_sort.md
index e4e806821..25fe686cc 100644
--- a/chapters/sorting_searching/bubble/bubble_sort.md
+++ b/chapters/sorting_searching/bubble/bubble_sort.md
@@ -8,20 +8,20 @@ In this way, we sweep through the array $$n$$ times for each element and continu
 This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with code similar to the following:
 
 {% method %}
-{% sample lang="jl" %}
-[import:1-10, lang:"julia"](code/julia/bubble.jl)
-{% sample lang="cs" %}
-[import:9-27, lang:"csharp"](code/cs/BubbleSort.cs)
 {% sample lang="c" %}
 [import:3-21, lang:"c_cpp"](code/c/bubble_sort.c)
-{% sample lang="js" %}
-[import:1-11, lang:"javascript"](code/js/bubble.js)
-{% sample lang="hs" %}
-[import, lang:"haskell"](code/haskell/bubbleSort.hs)
+{% sample lang="cs" %}
+[import:9-27, lang:"csharp"](code/cs/BubbleSort.cs)
 {% sample lang="cpp" %}
 [import, lang:"c_cpp"](code/c++/bubblesort.cpp)
-{% sample lang="d" %}
-[import, lang:"d"](code/d/bubble_sort.d)
+{% sample lang="hs" %}
+[import, lang:"haskell"](code/haskell/bubbleSort.hs)
+{% sample lang="js" %}
+[import:1-11, lang:"javascript"](code/js/bubble.js)
+{% sample lang="jl" %}
+[import:1-10, lang:"julia"](code/julia/bubble.jl)
+{% sample lang="py" %}
+[import:1-23, lang:"python"](code/python/bubble.py)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.