Merge pull request #25 from zacharyjones123/master

JavaDoc and No Spaces in File Names

Author: dynamitechetan

.classpath

@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry excluding="data_structures/" kind="src" path=""/>
+	<classpathentry kind="src" path="data_structures"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

.gitignore

@@ -0,0 +1 @@
+/bin/

.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>Java</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

Binary Search.java renamed to BinarySearch.java

@@ -1,6 +1,19 @@
-#import java.util.*;
-class Binary_Decimal
+import java.util.Scanner;
+
+/**
+ * This class converts a Binary number to a Decimal number
+ * 
+ * @author Unknown
+ *
+ */
+class BinaryToDecimal
 {
+	
+	/**
+	 * Main Method
+	 * 
+	 * @param args Command line arguments
+	 */
   public static void main(String args[])
   {
     Scanner sc=new Scanner(System.in);

Binary to Decimal.java renamed to BinaryToDecimal.java

@@ -1,7 +1,19 @@
 import java.util.Scanner;
 
+/**
+ * This class implements BubbleSort
+ * 
+ * @author Unknown
+ *
+ */
+
 class BubbleSort
 {
+	/**
+	 * Main Method
+	 * 
+	 * @param args Command line arguments
+	 */
 	public static void main(String[] args) 
 	{
 		int array[]=new int[6];

Bubble Sort.java renamed to BubbleSort.java

@@ -1,6 +1,18 @@
-#import java.util.*;
-class Decimal_Binary
+import java.util.Scanner;
+
+/**
+ * This class converts a Decimal number to a Binary number
+ * 
+ * @author Unknown
+ *
+ */
+class DecimalToBinary
 {
+	/**
+	 * Main Method
+	 * 
+	 * @param args Command Line Arguments
+	 */
   public static void main(String args[])
   {
     Scanner sc=new Scanner(System.in);

Decimal to Binary.java renamed to DecimalToBinary.java

@@ -1,7 +1,19 @@
-#import java.util.*;
+import java.util.Scanner;
+
+/**
+ * This class converts Decimal numbers to Octal Numbers
+ * 
+ * @author Unknown
+ *
+ */
 class Decimal_Octal
 {
-  public static void main()
+	/**
+	 * Main Method
+	 * 
+	 * @param args Command line Arguments
+	 */
+  public static void main(String[] args)
   {
     Scanner sc=new Scanner(System.in);
     int n,k,d,s=0,c=0;

Decimal to octal.java renamed to DecimalToOctal.java

@@ -1,7 +1,19 @@
 import java.util.Scanner;
 
+/**
+ * This program will print out the factorial of any non-negative
+ * number that you input into it.
+ * 
+ * @author Unknown
+ *
+ */
 public class Factorial{
 
+	/**
+	 * The main method
+	 * 
+	 * @param args Command line arguments
+	 */
 	public static void main(String[] args){
 		Scanner input = new Scanner(System.in);
 		//Prompt user to enter integer
@@ -20,7 +32,12 @@ public static void main(String[] args){
 		}	
 	}
 
-	//Factorial method
+	/**
+	 * Recursive Factorial Method
+	 * 
+	 * @param n The number to factorial
+	 * @return The factorial of the number
+	 */
 	public static long factorial(int n){
 
 		if (n==0){

Factorial.java

@@ -1,12 +1,27 @@
-/*
- * The Sieve of Eratosthenes is an algorithm used to find prime numbers, up to a given value.
+/**
+ * The Sieve of Eratosthenes is an algorithm use to find prime numbers,
+ * up to a given value.
  * Illustration: https://upload.wikimedia.org/wikipedia/commons/b/b9/Sieve_of_Eratosthenes_animation.gif
-*/
+ * (This illustration is also in the github repository)
+ * 
+ * @author Unknown
+ *
+ */
 public class FindingPrimes{
+	/**
+	 * The Main method
+	 * 
+	 * @param args Command line arguments
+	 */
 	public static void main(String args[]){
 		SOE(20); //Example: Finds all the primes up to 20
 	}
 
+	/**
+	 * The method implementing the Sieve of Eratosthenes
+	 * 
+	 * @param n Number to perform SOE on
+	 */
 	public static void SOE(int n){
 		boolean sieve[] = new boolean[n];