From 049087e941041646e538bb54d2c3a44e3bc1c018 Mon Sep 17 00:00:00 2001
From: LeenaKaushik11 <leenakaushik11@gmail.com>
Date: Thu, 26 Sep 2019 17:52:58 +0530
Subject: [PATCH] Algorithms of some sorting methods.

---
 algos/bubble sort in array.cpp | 36 ++++++++++++++++++++++++
 algos/insertionsortinarray.cpp | 31 +++++++++++++++++++++
 algos/mergesortinarray.cpp     | 50 ++++++++++++++++++++++++++++++++++
 algos/selectionsortinarray.cpp | 38 ++++++++++++++++++++++++++
 4 files changed, 155 insertions(+)
 create mode 100644 algos/bubble sort in array.cpp
 create mode 100644 algos/insertionsortinarray.cpp
 create mode 100644 algos/mergesortinarray.cpp
 create mode 100644 algos/selectionsortinarray.cpp

diff --git a/algos/bubble sort in array.cpp b/algos/bubble sort in array.cpp
new file mode 100644
index 0000000..2427328
--- /dev/null
+++ b/algos/bubble sort in array.cpp	
@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+void bubblesort(int a[],int n)
+{
+	int small;
+	for(int i=0;i<n;i++)
+	{
+		for(int j=i+1;j<n;j++)
+		{
+			if(a[i]>a[j])
+			swap(a[i],a[j]);
+		}
+	}
+}
+void view(int a[],int n)
+{
+	for(int i=0;i<n;i++)
+	{
+		cout<<a[i]<<"\t";
+	}
+}
+int main()
+{
+	int a[100],i,n;
+	cout<<"enter number of elements \n";
+	cin>>n;
+	for(i=0;i<n;i++)
+	{cout<<"enter value of "<<i+1<<" element \t";
+	cin>>a[i];
+	}
+	cout<<"\n**************before sort****************\n";
+	view(a,n);
+	bubblesort(a,n);
+		cout<<"\n*******************after sort****************\n";
+		view(a,n);
+	}
diff --git a/algos/insertionsortinarray.cpp b/algos/insertionsortinarray.cpp
new file mode 100644
index 0000000..40de816
--- /dev/null
+++ b/algos/insertionsortinarray.cpp
@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+void insertionsort(int A[],int n);
+int main()
+{
+	int a[100],k,i;
+	cout<<"enter no of values in your array\n";
+	cin>>k;
+	for(int i=0;i<k;i++)
+	{
+		cout<<"enter "<<i+1<<" element of array\n";
+		cin>>a[i];
+	}
+	insertionsort(a,k);
+	cout<<"after sorting\n";
+	for(i=0;i<k;i++)
+	{
+		cout<<a[i]<<endl;
+	}
+}
+
+void insertionsort(int a[],int n)
+{
+	int i,j,temp;
+	for(i=1;i<n;i++)
+	{
+		for(j=i-1;j>=0;j--)
+		if(a[j+1]<a[j])
+		swap(a[j+1],a[j]);
+	}
+}
diff --git a/algos/mergesortinarray.cpp b/algos/mergesortinarray.cpp
new file mode 100644
index 0000000..879dad0
--- /dev/null
+++ b/algos/mergesortinarray.cpp
@@ -0,0 +1,50 @@
+#include<iostream>
+using namespace std;
+void merge(int a[],int p,int q,int r)
+{
+	int n1=q-p+1;
+	int n2=r-q;
+	int L[n1+1],R[n2+1];
+	for(int i=1;i<=n1;i++)
+		L[i]=a[p+i-1];
+	for(int j=1;j<=n2;j++)
+		R[j]=a[q+j];
+	L[n1+1]=300;
+	R[n2+1]=300;
+	int i=1,j=1;
+	for(int k=p;k<=r;k++)
+	{
+		if(L[i]<=R[j])
+		{
+			a[k]=L[i];
+			i++;
+		}
+		else{
+			a[k]=R[j];
+			j++;
+		}
+	}
+}
+void mergesort(int a[], int p, int r)
+{
+	if(p<r)
+	{
+		int q=(p+r)/2;
+		mergesort(a,p,q);
+		mergesort(a,q+1,r);
+		merge(a,p,q,r);
+	}
+}
+
+int main()
+{
+	int a[10];
+	for(int i=1;i<=7;i++)
+	{
+		cin>>a[i];
+	}
+	mergesort(a,1,7);
+	for(int i=1;i<=7;i++)
+		cout<<a[i]<<"\t";
+	return 0;
+}
diff --git a/algos/selectionsortinarray.cpp b/algos/selectionsortinarray.cpp
new file mode 100644
index 0000000..33da17a
--- /dev/null
+++ b/algos/selectionsortinarray.cpp
@@ -0,0 +1,38 @@
+#include<iostream>
+using namespace std;
+void selectionsort(int a[],int n)
+{
+	int small;
+	for(int i=0;i<n;i++)
+	{
+		small=i;
+		for(int j=i+1;j<n;j++)
+		{
+			if(a[small]>a[j])
+			small=j;
+		}
+		swap(a[i],a[small]);
+	}
+}
+void view(int a[],int n)
+{
+	for(int i=0;i<n;i++)
+	{
+		cout<<a[i]<<"\t";
+	}
+}
+int main()
+{
+	int a[100],i,n;
+	cout<<"enter number of elements \n";
+	cin>>n;
+	for(i=0;i<n;i++)
+	{cout<<"enter value of"<<i+1<<" element \t";
+	cin>>a[i];
+	}
+	cout<<"\n**************before sort****************\n";
+	view(a,n);
+	selectionsort(a,n);
+		cout<<"\n*******************after sort****************\n";
+		view(a,n);
+	}