Create Mergesort.cpp

[pranaydeep1]

Added MergeSort Algorithm

[github-actions]

👋 @pranaydeep1
Thank you for raising your pull request.
Please make sure you have followed our contributing guidelines. We will review it as soon as possible.

[iamwatchdogs]

Hi @pranaydeep1, It's seems like you have some formatting issue with your source code. Please format you code properly so that we can proceed to merging your PR.

If you need some help with formatting, you can checkout the results of the linting workflow under the show diff and exit section.

[iamwatchdogs]

Hi @pranaydeep1, It's great to see you following the guidelines but it seems like you still haven't formatted your source code. Here are the required changes you need to make to format your source code,

View the changes

Don't worry it's still your code but formatted.

Suggested change

	#include <bits/stdc++.h>
	using namespace std;
	// Merges two subarrays of arr[].
	// First subarray is arr[left..mid]
	// Second subarray is arr[mid+1..right]
	void merge(vector<int>& arr, int left,
	int mid, int right)
	{
	int n1 = mid - left + 1;
	int n2 = right - mid;
	// Create temp vectors
	vector<int> L(n1), R(n2);
	// Copy data to temp vectors L[] and R[]
	for (int i = 0; i < n1; i++)
	L[i] = arr[left + i];
	for (int j = 0; j < n2; j++)
	R[j] = arr[mid + 1 + j];
	int i = 0, j = 0;
	int k = left;
	// Merge the temp vectors back
	// into arr[left..right]
	while (i < n1 && j < n2) {
	if (L[i] <= R[j]) {
	arr[k] = L[i];
	i++;
	}
	else {
	arr[k] = R[j];
	j++;
	}
	k++;
	}
	// Copy the remaining elements of L[],
	// if there are any
	while (i < n1) {
	arr[k] = L[i];
	i++;
	k++;
	}
	// Copy the remaining elements of R[],
	// if there are any
	while (j < n2) {
	arr[k] = R[j];
	j++;
	k++;
	}
	}
	// begin is for left index and end is right index
	// of the sub-array of arr to be sorted
	void mergeSort(vector<int>& arr, int left, int right)
	{
	if (left >= right)
	return;
	int mid = left + (right - left) / 2;
	mergeSort(arr, left, mid);
	mergeSort(arr, mid + 1, right);
	merge(arr, left, mid, right);
	}
	// Function to print a vector
	void printVector(vector<int>& arr)
	{
	for (int i = 0; i < arr.size(); i++)
	cout << arr[i] << " ";
	cout << endl;
	}
	// Driver code
	int main()
	{
	vector<int> arr = { 12, 11, 13, 5, 6, 7 };
	int n = arr.size();
	cout << "Given vector is \n";
	printVector(arr);
	mergeSort(arr, 0, n - 1);
	cout << "\nSorted vector is \n";
	printVector(arr);
	return 0;
	}
	#include <bits/stdc++.h>
	using namespace std;
	// Merges two subarrays of arr[].
	// First subarray is arr[left..mid]
	// Second subarray is arr[mid+1..right]
	void merge(vector<int>& arr, int left, int mid, int right) {
	int n1 = mid - left + 1;
	int n2 = right - mid;
	// Create temp vectors
	vector<int> L(n1), R(n2);
	// Copy data to temp vectors L[] and R[]
	for (int i = 0; i < n1; i++) L[i] = arr[left + i];
	for (int j = 0; j < n2; j++) R[j] = arr[mid + 1 + j];
	int i = 0, j = 0;
	int k = left;
	// Merge the temp vectors back
	// into arr[left..right]
	while (i < n1 && j < n2) {
	if (L[i] <= R[j]) {
	arr[k] = L[i];
	i++;
	} else {
	arr[k] = R[j];
	j++;
	}
	k++;
	}
	// Copy the remaining elements of L[],
	// if there are any
	while (i < n1) {
	arr[k] = L[i];
	i++;
	k++;
	}
	// Copy the remaining elements of R[],
	// if there are any
	while (j < n2) {
	arr[k] = R[j];
	j++;
	k++;
	}
	}
	// begin is for left index and end is right index
	// of the sub-array of arr to be sorted
	void mergeSort(vector<int>& arr, int left, int right) {
	if (left >= right) return;
	int mid = left + (right - left) / 2;
	mergeSort(arr, left, mid);
	mergeSort(arr, mid + 1, right);
	merge(arr, left, mid, right);
	}
	// Function to print a vector
	void printVector(vector<int>& arr) {
	for (int i = 0; i < arr.size(); i++) cout << arr[i] << " ";
	cout << endl;
	}
	// Driver code
	int main() {
	vector<int> arr = {12, 11, 13, 5, 6, 7};
	int n = arr.size();
	cout << "Given vector is \n";
	printVector(arr);
	mergeSort(arr, 0, n - 1);
	cout << "\nSorted vector is \n";
	printVector(arr);
	return 0;
	}

[github-actions]

This PR is stale because it has been open 45 days with no activity. Remove stale label or comment or this will be closed in 10 days.

[github-actions]

This PR was closed because it has been stalled for 10 days with no activity.