Working on merge sort. Issue in calculating mid.

jwasham · jwasham · commit 17335079de2d · 2016-07-19T17:55:01.000-07:00
diff --git a/experiments/gup.py b/experiments/gup.py
@@ -0,0 +1,23 @@
+import os
+
+my_string = "Hello, friends."
+
+print(my_string[0:3])
+
+print(my_string)
+
+filepath = "new_file"
+
+
+out_file = open(filepath, "ab")
+
+print(out_file.mode)
+print(out_file.name)
+
+out_file.write(bytes("yo\n", "UTF-8"))
+
+out_file.close()
+
+os.remove(filepath)
+
+# print(os.urandom(24))
diff --git a/merge_sort/main.py b/merge_sort/main.py
@@ -0,0 +1,23 @@
+from merge_sort import MergeSort
+
+
+def main():
+    original = [325432, 989, 547510, 3]
+
+    #, 547510, 3, -93]
+
+               #  -93, 189019, 5042, 123, 597, 42, 7506, 184,
+               # 184, 2409, 45, 824, 4, -2650, 9, 662, 3928, -170, 45358, 395, 842,
+               # 7697, 110, 14, 99, 221]
+
+    numbers = original[:]
+
+    ms = MergeSort(numbers)
+
+    output = ms.sort()
+
+    print(output)
+    print("We're done here.")
+
+if __name__ == "__main__":
+    main()
diff --git a/merge_sort/merge_sort.py b/merge_sort/merge_sort.py
@@ -0,0 +1,46 @@
+import math
+
+
+class MergeSort(object):
+    def __init__(self, numbers):
+        self.values = numbers
+        self.count = len(numbers)
+
+    def sort(self):
+        self.merge_sort(0, self.count - 1)
+        return self.values
+
+    def merge_sort(self, low, high):
+        if low < high:
+            mid =  you were here: (low + high) / 2
+            self.merge_sort(low, mid)
+            self.merge_sort(mid + 1, high)
+            self.merge(low, mid, high)
+
+    def merge(self, low, mid, high):
+        b = []
+        i = 0
+        j = mid + 1
+
+        m = 0
+
+        while i <= low and j <= high:
+            if self.values[i] <= self.values[j]:
+                b.append(self.values[i])
+                i += 1
+            else:
+                b.append(self.values[j])
+                j += 1
+
+        while i <= mid:
+            b.append(self.values[i])
+            i += 1
+
+        while j <= high:
+            b.append(self.values[j])
+            j += 1
+
+        for index, val in enumerate(b):
+            self.values[low + index] = val
+
+        m += 1
