change implementation to merge-sort

sorting.cpp

@@ -3,21 +3,45 @@
 #include "sorting.h"
 using namespace std;
 
-vector<int> sort_custom(vector<int> c){
-  bool pass = false; //have we passed through the cay without a swap?
-  int temp;
+vector<int> sort_custom(vector<int> m)
+{
+   if (m.size() <= 1)
+      return m;
+ 
+   vector<int> left, right, result;
+   int middle = ((int)m.size()+ 1) / 2;
+ 
+   for (int i = 0; i < middle; i++) {
+      left.push_back(m[i]);
+   }
 
-  while (!pass){
-    pass = true;
-    for (int i=0; i<c.size()-1; i++){
-      if (c[i] > c[i+1]){
-        pass = false;
-        temp = c[i];
-        c[i] = c[i+1];
-        c[i+1] = temp;
+   for (int i = middle; i < (int)m.size(); i++) {
+      right.push_back(m[i]);
+   }
+ 
+   left = sort_custom(left);
+   right = sort_custom(right);
+   while ((int)left.size() > 0 || (int)right.size() > 0) {
+      if ((int)left.size() > 0 && (int)right.size() > 0) {
+         if ((int)left.front() <= (int)right.front()) {
+            result.push_back((int)left.front());
+            left.erase(left.begin());
+         } 
+   else {
+            result.push_back((int)right.front());
+            right.erase(right.begin());
+         }
+      }  else if ((int)left.size() > 0) {
+            for (int i = 0; i < (int)left.size(); i++)
+               result.push_back(left[i]);
+            break;
+      }  else if ((int)right.size() > 0) {
+            for (int i = 0; i < (int)right.size(); i++)
+               result.push_back(right[i]);
+            break;
       }
-    }
-  }
-  return c;
+   }
+ 
+   return result;
 }