Fixing the sort programs

retroprogrammer000 · retroprogrammer000 · commit 23dbc8757dae · 2016-12-31T11:56:42.000-08:00
diff --git a/data_structures/sorts/Binary Search.java b/data_structures/sorts/Binary Search.java
@@ -1,3 +1,5 @@
+package sorts;
+
 import java.util.Scanner;
 
 class BinarySearch
diff --git a/data_structures/sorts/Bubble Sort.java b/data_structures/sorts/Bubble Sort.java
@@ -1,3 +1,5 @@
+package sorts;
+
 import java.util.Scanner;
 
 class BubbleSort
diff --git a/data_structures/sorts/FindingPrimes.java b/data_structures/sorts/FindingPrimes.java
@@ -1,3 +1,5 @@
+package sorts;
+
 /*
  * The Sieve of Eratosthenes is an algorithm used to find prime numbers, up to a given value.
  * Illustration: https://upload.wikimedia.org/wikipedia/commons/b/b9/Sieve_of_Eratosthenes_animation.gif
diff --git a/data_structures/sorts/HeapSort.java b/data_structures/sorts/HeapSort.java
@@ -1,3 +1,5 @@
+package sorts;
+
 import java.util.Scanner;
 
 /**
diff --git a/data_structures/sorts/Insertion Sort.java b/data_structures/sorts/Insertion Sort.java
@@ -1,3 +1,5 @@
+package sorts;
+
 import java.util.Scanner;
 
 class InsertionSort
diff --git a/data_structures/sorts/MergeSort.java b/data_structures/sorts/MergeSort.java
@@ -1,3 +1,5 @@
+package sorts;
+
 import java.util.Scanner;
 
 /**
diff --git a/data_structures/sorts/Selection Sort.java b/data_structures/sorts/Selection Sort.java
@@ -1,3 +1,5 @@
+package sorts;
+
 import java.util.Scanner;
 
 class SelectionSort

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+package sorts;`
	`2`	`+`
`1`	`3`	`/*`
`2`	`4`	`* The Sieve of Eratosthenes is an algorithm used to find prime numbers, up to a given value.`
`3`	`5`	`* Illustration: https://upload.wikimedia.org/wikipedia/commons/b/b9/Sieve_of_Eratosthenes_animation.gif`