sorting-algorithm/mergeSort.cpp at master · priyanshi9692/sorting-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <iostream>
#include <vector>

using namespace std;

void print(vector<int> &v)
{
  for(int i = 0; i < v.size(); i++)
  {
     cout << v[i] << " ";
  cout << endl;
}
}

vector<int> merge(vector<int> &left, vector<int> &right)
{
   vector<int> result;
   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 result;
}

vector<int> mergeSort(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]);
   }

   for (int i = middle; i < (int)m.size(); i++) {
      right.push_back(m[i]);
   }

   left = mergeSort(left);
   right = mergeSort(right);
   result = merge(left, right);

   return result;
}

int main()
{
   vector<int> v;

   v.push_back(38);
   v.push_back(27);
   v.push_back(43);
   v.push_back(3);
   v.push_back(9);
   v.push_back(82);
   v.push_back(10);

   print(v);
   cout << "------------------" << endl;

   v = mergeSort(v);

   print(v);
}