Merge pull request #747 from PedroNC18/patch-7

Create Merge_sort.cpp

Author: matthewsamuel95

Sorting/Merge Sort/C++/Merge_sort.cpp

@@ -0,0 +1,67 @@
+#include<iostream>
+using namespace std;
+
+void merge(int A[], int inicio, int meio, int fim){
+	int i=0, j=0, k=0;
+	int temp[100000], p1, p2, tam;
+	int fim1=0, fim2=0;
+	tam = fim-inicio+1;
+	p1 = inicio;
+	p2=meio+1;
+	for(i=0;i<tam;i++){
+		if(!fim1 && !fim2){
+			if(A[p1]<A[p2]){
+				temp[i] = A[p1++];
+			}
+			else{
+				temp[i] = A[p2++];
+			}
+			if(p1>meio){
+				fim1 = 1;
+			}
+			if(p2>fim){
+				fim2 = 1;
+			}
+		}
+		else{
+			if(!fim1){
+				temp[i] = A[p1++];
+			}
+			else{
+				temp[i] = A[p2++];
+			}
+		}
+	}
+	for(j=0,k=inicio;j<tam;j++,k++){
+		A[k] = temp[j];
+	}
+}
+
+void merge_sort(int A[], int inicio, int fim){
+	int meio;
+	if(inicio<fim){
+		meio = (inicio+fim)/2;
+		merge_sort(A,inicio,meio);
+		merge_sort(A,meio+1,fim);
+		merge(A,inicio,meio,fim);
+	}
+}
+
+int main() {
+	ios::sync_with_stdio(0);
+    	cin.tie(0);
+    
+	int vet[100000], vetn=0;
+	cin >> vetn;
+	int i;
+	for(i=0;i<vetn;i++){
+		cin >> vet[i];
+	}
+	
+	//---(COLOCAR UMA FUNCAO SORT NESSE LUGAR)----//
+	
+	for(i=0;i<vetn;i++){
+		cout << vet[i] << " ";
+	}
+	return 0;
+}