hackoctoberfest2021/mergeSort.cpp at main · kryptonedu/hackoctoberfest2021 · 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
90
91
92
93
94
95
96
97
98
99
100
101
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;


int partition(int arr[],int p,int r )
{
	int piv,i,j,a,b;
	piv=arr[r];
	i=p-1;
	for(j=p;j<=r-1;j++)
	{
		if(arr[j]<=piv)
		{
			i++;
			swap(arr[i],arr[j]);

		}
	}
	swap(arr[i+1],arr[r]);
return(i+1);
}

void merge(int arr[],int p,int q,int r)
{
	int n1,n2,i,j,k,R[10],L[10];
	n1=q-p+1;
	n2=r-q;
	for(i=1;i<=n1;i++)
	{
		L[i]=arr[p+i-1];
	}
	for(j=1;j<=n2;j++)
	{
		R[j]=arr[j+q];
	}
	L[n1+1]=1000000;
	R[n2+1]=1000000;
	i=1;j=1;
	for(k=p;k<=r;k++)
{
	if(L[i]<=R[j])
	{
		arr[k]=L[i];
		i++;
	}
	else{
		arr[k]=R[j];
		j++;
	}
}
}


void merge_sort(int arr[],int p,int r)
{
	int q;
	if(p<r)
	{
		q=(p+r)/2;
		merge_sort(arr,p,q);
		merge_sort(arr,q+1,r);
		merge(arr,p,q,r);
	}
}


void quick_sort(int arr[],int p,int r)
{
	int q;
	if(p<r)
	{
	   q=partition(arr,p,r);
	   quick_sort(arr,p,q-1);
		quick_sort(arr,q+1,r);
	}
}


int main()
{
	int n,i,j,r,arr[20],p;
	printf("enter no of numbers u want in array:");
	scanf("%d",&r);
	for(i=1;i<=r;i++)
	{
		scanf("%d",&arr[i]);
	}
	p=1;
	printf("sorting by mergesort");
	merge_sort(arr,p,r);
	for(i=1;i<=r;i++)
	printf("%d ",arr[i]);
	printf("\n");
	printf("sorting by quicksort");
		quick_sort(arr,p,r);
	for(i=1;i<=r;i++)
	printf("%d ",arr[i]);
return 0;
}