Renaming sorting package/directory.

Tozu2500 · web-flow · commit cbf5c6b44e83 · 2026-03-21T01:16:36.000+02:00
Renaming sorting package/directory to sortingalgorithms.
Added MergeSort.
diff --git a/Practice/sortingalgorithms/BubbleSort.java b/Practice/sortingalgorithms/BubbleSort.java
@@ -0,0 +1,48 @@
+package com.tozu.sorting;
+
+public class BubbleSort {
+	
+	public static void bubbleSort(int[] arr) {
+		int n = arr.length;
+		boolean swapped;
+		
+		// Outer loop for passes
+		for (int i = 0; i < n - 1; i++) {
+			swapped = false;
+			
+			// Inner loop for comparisons
+			for (int j = 0; j < n - i - 1; j++) {
+				// Adjacent element comparison
+				if (arr[j] > arr[j + 1]) {
+					// Swap, if out of order
+					int temp = arr[j];
+					arr[j] = arr[j + 1];
+					arr[j + 1] = temp;
+					swapped = true;
+				}
+			}
+			
+			// If no swaps happened the array was already sorted
+			if (!swapped) break;
+		}
+	}
+	
+	public static void printArray(int[] arr) {
+		for (int num : arr) {
+			System.out.print(num + " ");
+		}
+	}
+
+	public static void main(String[] args) {
+		int[] arr = {64, 34, 25, 22, 12, 90};
+		System.out.print("Original array: ");
+		printArray(arr);
+		System.out.println();
+		
+		bubbleSort(arr);
+		
+		System.out.print("Sorted array: ");
+		printArray(arr);
+	}
+
+}
diff --git a/Practice/sortingalgorithms/MergeSort.java b/Practice/sortingalgorithms/MergeSort.java
@@ -0,0 +1,71 @@
+package com.tozu.sorting;
+
+import java.util.Random;
+
+public class MergeSort {
+	
+	public static void mergeSort(int[] arr) {
+		// In this case, the array only contains one element.
+		// That means, that it is already sorted.
+		if (arr.length <= 1) {
+			return;
+		}
+		
+		int mid = arr.length / 2;
+		
+		int[] left = new int[mid];
+		int[] right = new int[arr.length - mid];
+		
+		// Data copying
+		System.arraycopy(arr, 0, left, 0, mid);
+		System.arraycopy(arr, mid, right, 0, arr.length - mid);
+		
+		// Recursive sorting
+		mergeSort(left);
+		mergeSort(right);
+		
+		// Merge
+		merge(arr, left, right);
+	}
+	
+	private static void merge(int[] arr, int[] left, int[] right) {
+		int i = 0, j = 0, k = 0;
+		
+		while (i < left.length && j < right.length) {
+			if (left[i] <= right[j]) {
+				arr[k++] = left[i++];
+			} else {
+				arr[k++] = right[j++];
+			}
+		}
+		
+		// Remaining elements
+		while (i < left.length) {
+			arr[k++] = left[i++];
+		}
+		
+		while (j < right.length) {
+			arr[k++] = right[j++];
+		}
+	}
+
+	public static void main(String[] args) {
+
+		Random random = new Random();
+		
+		// Declare an array with X amount of elements
+		int[] arr = new int[100000000];
+		
+		// Add random elements to the array
+		for (int i = 0; i < arr.length; i++) {
+			arr[i] = random.nextInt(1000);
+		}
+		
+		mergeSort(arr);
+		
+		for (int num : arr) {
+			System.out.print(num + " ");
+		}
+	}
+
+}
diff --git a/Practice/sortingalgorithms/SelectionSort.java b/Practice/sortingalgorithms/SelectionSort.java
@@ -0,0 +1,52 @@
+package com.tozu.sorting;
+
+public class SelectionSort {
+	
+	public static void selectionSort(int[] arr) {
+		int n = arr.length;
+		
+		for (int i = 0; i < n - 1; i++) {
+			int minIndex = i;
+			
+			for (int j = i + 1; j < n; j++) {
+				if (arr[j] <= arr[minIndex]) {
+					minIndex = j;
+				}
+			}
+			
+			int temp = arr[minIndex];
+			arr[minIndex] = arr[i];
+			arr[i] = temp;
+		}
+	}
+	
+	public static void printArray(int[] arr) {
+		for (int value : arr) {
+			System.out.print(value + " ");
+		}
+		System.out.println();
+	}
+
+	public static void main(String[] args) {
+
+		int[] data = {33, 64, 25, 12, 22, 11};
+		int[] data2 = {104, 55, 78, 224, 5, 19, 34, 7};
+		
+		System.out.println("Original array (1):");
+		printArray(data);
+		
+		selectionSort(data);
+		
+		System.out.println("Sorted array (1):");
+		printArray(data);
+
+		System.out.println("Original array (2):");
+		printArray(data2);
+		
+		selectionSort(data2);
+		
+		System.out.println("Sorted array (2):");
+		printArray(data2);
+	}
+
+}
