Added sorting algorithms.

Sorting algorithms/Mayur/BubbleSort

@@ -0,0 +1,34 @@
+import java.util.Scanner;
+public class Bubble_sort {
+ 	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner s = new Scanner(System.in);
+		System.out.println("Enter size of array: ");
+		int n=s.nextInt();
+		int[] arr=new int[5];
+		System.out.println("Enter elements of array: ");
+		for(int i=0;i<arr.length;i++)
+			arr[i]=s.nextInt();
+		System.out.println("Array after sorting is: ");
+		Bubble_Sort(arr);
+		for(int i=0;i<arr.length;i++)
+			System.out.println(arr[i]);
+	}
+ 	public static void Bubble_Sort(int[] arr)
+	{
+		int temp;
+		for(int i=1;i<arr.length;i++)
+		{
+			for(int j=0;j<arr.length-i;j++)
+			{
+				if(arr[j]>arr[j+1])
+				{
+					temp=arr[j];
+					arr[j]=arr[j+1];
+					arr[j+1]=temp;
+				}
+			}
+		}
+	}
+
+}

Sorting algorithms/Mayur/MergeSort.java

@@ -0,0 +1,59 @@
+public class MergeSort {
+ 	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int[] arr = {8,7,10,6,9,3};
+		int[] ans=MergeSort(arr,0,arr.length-1);
+		for(int i=0;i<arr.length;i++)
+			System.out.print(ans[i]+" ");
+	}
+ 	public static int[] MergeSort(int[] arr,int low,int high)
+	{
+		if(low==high)
+		{
+			int[] a = {arr[high]};
+			return a;
+		}
+		int mid = (low+high)/2;
+		int[] fhalf = MergeSort(arr,low,mid);
+		int[] shalf = MergeSort(arr,mid+1,high);
+		int[] sorted = Merge(fhalf,shalf);
+		return sorted;
+	}
+
+	public static int[] Merge(int[] a1,int[] a2)
+	{
+		int[] ans = new int[a1.length+a2.length];
+		int k=0;
+		int i=0;
+		int j=0;
+		while(i<a1.length && j<a2.length)
+		{
+			if(a1[i]<a2[j])
+			{
+				ans[k]=a1[i];
+				k++;
+				i++;
+			}
+			else
+			{
+				ans[k]=a2[j];
+				k++;
+				j++;
+			}
+		}	
+		while(i!=a1.length)
+		{
+			ans[k]=a1[i];
+			k++;
+			i++;
+		}
+		while(j!=a2.length)
+		{
+			ans[k]=a2[j];
+			k++;
+			j++;
+		}
+	return ans;
+	}
+
+}

Sorting algorithms/Mayur/QuickSort.java

@@ -0,0 +1,45 @@
+public class QuickSort {
+ 	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int[] arr = {10,1,4,2,15,6,3,9,8,13};
+		quicksort(arr,0,arr.length-1);
+		for(int i=0;i<arr.length;i++)
+			System.out.print(arr[i]+" ");
+	}
+
+	public static void quicksort(int[] arr,int start,int end)
+	{
+		int indx = quicksortHelper(arr,start,end);
+		if(indx-1>start)	//Left SubArray contains more than 1 element.
+			quicksort(arr,start,indx-1);
+		if(indx+1<end)	//Right SubArray contains more than 1 element;
+			quicksort(arr,indx+1,end);
+	}
+
+	public static int quicksortHelper(int[] arr,int start,int end)
+	{
+		int left = start;
+		int right = end;
+		int pivot = start;
+		int temp;
+		while(true)
+		{
+			while(arr[right]>=arr[pivot] && right!=pivot)
+				right--;
+			if(right==pivot)
+				return pivot;
+			temp = arr[pivot];
+			arr[pivot] = arr[right];
+			arr[right] = temp;
+			pivot = right;
+			while(arr[left]<=arr[pivot] && left!=pivot)
+				left++;
+			if(left==pivot)
+				return pivot;
+			temp = arr[pivot];
+			arr[pivot] = arr[left];
+			arr[left] = temp;
+			pivot = left;
+		}
+	}
+ }

Sorting algorithms/Mayur/SelectionSort.java

@@ -0,0 +1,34 @@
+import java.util.Scanner;
+ public class SelectionSort {
+ 	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner s = new Scanner(System.in);
+		System.out.println("Enter Size of array: ");
+		int n=s.nextInt();
+		int[] arr=new int[n];
+		System.out.println("Enter elements of array: ");
+		for(int i=0;i<arr.length;i++)
+			arr[i]=s.nextInt();
+		Selection_Sort(arr);
+		System.out.println("Array after sorting: ");
+		for(int i=0;i<arr.length;i++)
+			System.out.println(arr[i]);
+	}
+ 	public static void Selection_Sort(int[] arr)
+	{
+		int min,temp;
+		for(int i=0;i<arr.length-1;i++)
+		{
+			min=i;
+			for(int j=i+1;j<arr.length;j++)
+			{
+				if(arr[min]>arr[j])
+					min=j;
+			}
+			temp=arr[i];
+			arr[i]=arr[min];
+			arr[min]=temp;
+		}
+	}
+
+}