added some changes

Contributors.html

@@ -600,13 +600,16 @@
 <a class="box-item" href="https://github.com/amazing-AK"><span>Aditya Krishna</span></a>
 <a class="box-item" href="https://github.com/yashjain1974"><span>Yash jain</span></a>
 <a class="box-item" href="https://github.com/Ttecs"><span>Tharaka Bandara</span></a>
+
 <a class="box-item" href="https://github.com/Krishnapro"><span>Krishna Kumar</span> </a>
 
 <a class="box-item" href="https://github.com/winxter17"><span>Sharad Kumar</span></a>
      <a class="box-item" href="https://github.com/SaranyaSkumar"><span>Saranya S kumar</span></a>
   <a class="box-item" href="https://github.com/zaabdn"><span>Zainal Abidin</span></a>
     <a class="box-item" href="https://github.com/Krishnapal-rajput"><span>Krishnapal Rajput</span></a>
     <a class="box-item" href="https://github.com/SamirKaushik"><span>Samir Kaushik</span></a>
+      <a class="box-item" href="https://github.com/Aman1905"><span>Aman Chopra</span></a>
+
 
 
 

Program's_Contributed_By_Contributors/Java/Sorting Algos/BubbleSort.java

@@ -0,0 +1,41 @@
+
+
+import java.util.Arrays;
+
+public class BubbleSort {
+
+	public static void main(String[] args) {
+		int[] arr = { 5, 4, 3, 2, 1 };
+		bubble(arr);
+		System.out.println(Arrays.toString(arr));
+
+	}
+
+	static void bubble(int[] arr) {
+
+		boolean swapped;
+//		run the steps N-1 times
+
+		for (int i = 0; i < arr.length; i++) {
+			swapped = false;
+//			for each step, max item will come at last respective index
+
+			for (int j = 1; j < arr.length - i; j++) {
+//				swap if the items are smaller than previous item
+
+				if (arr[j] < arr[j - 1]) {
+					int temp = arr[j];
+					arr[j] = arr[j - 1];
+					arr[j - 1] = temp;
+					swapped = true;
+				}
+			}
+
+//			if you did not swap for a particular value of i, it means array is sorted hence stop program
+
+			if(!swapped)
+				break;
+		}
+	}
+
+}

Program's_Contributed_By_Contributors/Java/Sorting Algos/CyclicSort.java

@@ -0,0 +1,43 @@
+
+import java.util.*;
+
+public class CyclicSort {
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+
+		int[] arr = {3, 5, 2, 1, 4};
+//		always remember it should be continous
+
+		sorting(arr);
+		System.out.println(Arrays.toString(arr));
+
+	}
+
+//	Algo :-
+//	1. Start looping from i
+//	2. Put it at corrct index
+//	3. Only move i when the element at i is sorted
+
+	static void sorting(int[] arr) {
+		int i = 0;
+		while (i < arr.length) {
+			int correctInd = arr[i] - 1;
+//			this should be the correct index
+
+			if (arr[i] != arr[correctInd]) {
+				swap(arr, i, correctInd);
+			} else {
+				i++;
+			}
+		}
+	}
+
+	static void swap(int[] arr, int first, int second) {
+		int temp = arr[first];
+		arr[first] = arr[second];
+		arr[second] = temp;
+
+	}
+
+}

Program's_Contributed_By_Contributors/Java/Sorting Algos/InsertionSort.java

@@ -0,0 +1,33 @@
+
+import java.util.*;
+
+public class InsertionSort {
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+
+		int[] arr = { 5, 3, 4, 1, 2 };
+		insertionSorting(arr);
+		System.out.println(Arrays.toString(arr));
+
+	}
+
+	static void insertionSorting(int[] arr) {
+		for (int i = 0; i < arr.length - 1; i++) {
+			for (int j = i + 1; j > 0; j--) {
+				if (arr[j] < arr[j - 1]) {
+					swapArray(arr, j, j - 1);
+				} else {
+					break;
+				}
+			}
+		}
+	}
+
+	static void swapArray(int[] arr, int first, int second) {
+		int temp = arr[first];
+		arr[first] = arr[second];
+		arr[second] = temp;
+	}
+
+}

Program's_Contributed_By_Contributors/Java/Sorting Algos/SelectionSort.java

@@ -0,0 +1,42 @@
+
+import java.util.*;
+
+public class SelectionSort {
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+
+		int[] arr = { 4, 6, 7, 2, 1, 5, 3, 8, 9 };
+		selectionSorting(arr);
+		System.out.println(Arrays.toString(arr));
+
+	}
+
+	static void selectionSorting(int[] arr) {
+		for (int i = 0; i < arr.length; i++) {
+//			find the max item in the remaining array and swap with correct index
+
+			int last = arr.length - i - 1;
+
+			int maxInd = getMaxInd(arr, 0, last);
+			swapArray(arr, maxInd, last);
+		}
+	}
+
+	private static int getMaxInd(int[] arr, int start, int end) {
+		int max = start;
+
+		for (int i = start; i <= end; i++) {
+			if (arr[max] < arr[i])
+				max = i;
+		}
+		return max;
+	}
+
+	static void swapArray(int[] arr, int first, int second) {
+		int temp = arr[first];
+		arr[first] = arr[second];
+		arr[second] = temp;
+	}
+
+}