Merge Sort

Author: jimmy17x

Diff for: bin/sequentialCollection/dance.txt

@@ -0,0 +1,12 @@
+M Raymond Williams
+F Cynthia Fehrenbach
+F Jennifer Ingram
+M David Durr
+M Bryan Frazer
+F Beata Lovelace
+F Alisa Brown
+M Clayton Ruff
+M Terrill Beckerman
+F Cindy Beck
+M Mayo Johnson
+M Mike Dahly

Diff for: bin/sortingNSearching/Bitset.class

@@ -0,0 +1,18 @@
+package sortingNSearching;
+
+import java.util.BitSet;
+
+public class   Bitset {
+
+	public static void main(String[] args) {
+		BitSet bs = new BitSet();
+		int arr[] = {5,3,9,3,7,8};
+		
+		for(int i = 0  ; i < arr.length ; ++i)
+			if(bs.get(arr[i]))
+				System.out.println(arr[i] + " is already present ");
+			else
+				bs.set(arr[i]);
+	}
+
+}

Diff for: bin/sortingNSearching/BubbleSort.class

@@ -0,0 +1,33 @@
+package sortingNSearching;
+
+public class BubbleSort {
+
+	public static void main(String[] args) {
+		int num[] = new int[10];
+		for (int i = 0; i < num.length; ++i) {
+			num[i] = (int) (Math.random() * 100);
+		}
+
+		// before sort
+		System.out.println("Before sort : ");
+		for (int i = 0; i < num.length; ++i)
+			System.out.print (num[i] + " ");
+
+		System.out.println("\n after sort : ");
+
+		for (int passes = 1; passes < num.length; ++passes)
+			for (int j = 0; j < num.length - passes ; ++j) {
+				if(num[j] > num[j+1]  )
+				{
+					int temp = num[j];
+					num[j] = num[j+1] ;
+					num[j+1] = temp;
+							
+				}
+			}
+		
+		for(int i= 0 ; i < num.length ; ++i)
+			System.out.print(num[i] + " ");
+	}
+
+}

Diff for: bin/sortingNSearching/InsertionSort.class

@@ -0,0 +1,25 @@
+package sortingNSearching;
+
+public class InsertionSort {
+
+	public static void main(String[] args) {
+		int numbers[] = { 1, 5, 8, 4, 3, 13, 99, 3, 67, 33 };
+
+		for (int i = 1; i < numbers.length; ++i) {
+			int key = numbers[i];
+			int j = i - 1;
+			while( j >= 0 && numbers[j] > key)
+			{
+				numbers[j+1] = numbers[j];
+				--j;
+			}
+			numbers[j+1] = key;
+			
+		}
+
+		for (Integer i : numbers)
+			System.out.println(i);
+
+	}
+
+}

Diff for: bin/sortingNSearching/MergeSort.class

@@ -0,0 +1,64 @@
+package sortingNSearching;
+
+public class MergeSort {
+
+	public static void main(String[] args) {
+		int num[] = new int[10];
+		for (int i = 0; i < num.length; ++i) {
+			num[i] = (int) (Math.random() * 100);
+		}
+
+		// before sort
+		System.out.println("Before sort : ");
+		for (int i = 0; i < num.length; ++i)
+			System.out.print(num[i] + " ");
+
+		System.out.println("\n after sort : ");
+
+		int helper[] = new int[num.length];
+
+		mergeSort(num, helper, 0, num.length - 1);
+
+		// before sort
+		System.out.println("Before sort : ");
+		for (int i = 0; i < num.length; ++i)
+			System.out.print(num[i] + " ");
+
+	}
+
+	private static void mergeSort(int[] num, int[] helper, int low, int high) {
+		if (low < high) {
+			int mid =  (high + low) / 2;
+			mergeSort(num, helper, low, mid);
+			mergeSort(num, helper, mid + 1, high);
+			merge(num, helper, low, mid, high);
+		}
+
+	}
+
+	private static void merge(int[] num, int[] helper, int low, int mid,
+			int high) {
+
+		// copy both halves in helper array
+		for (int i = low; i <= high; ++i)
+			helper[i] = num[i];
+		int helperLeft = low;
+		int helperRight = mid + 1;
+		int current = low;
+
+		while (helperLeft <= mid && helperRight <= high) {
+			if (helper[helperLeft] <= helper[helperRight]) {
+				num[current++] = helper[helperLeft++];
+
+			} else {
+				num[current++] = helper[helperRight++];
+			}
+		}
+
+		int remaining = mid - helperLeft;
+
+		for (int i = 0; i <= remaining; ++i) {
+			num[current + i] = helper[helperLeft + i];
+		}
+	}
+}