Merge pull request larissalages#22 from ani538/master

Removed bugs from MergeSort.java

Author: larissalages

classical_algorithms/MergeSort.class

@@ -1,5 +1,4 @@
 import java.util.*;
-import java.lang.*;
 
 
 class MergeSort
@@ -73,21 +72,19 @@ static void printArray(int a[], int n)
 
  	public static void main(String args[])
 	{
+		Scanner scan= new Scanner(System.in);
 		try{
-			int low,high,mid;
+			int low,high;
 			int n,i;
-
-			Scanner scan= new Scanner(System.in);
-	
 			System.out.println("How many elements do you want in the array?");
 			n=scan.nextInt();
 			int a[]= new int[n];
 			System.out.println("Enter the array elements one by one");
+
 			for(i=0;i<n;i++)
-			{
-				a[i]=scan.nextInt();		
+			{	
+				a[i]=scan.nextInt();	
 			}
-
 			System.out.println("Array before sorting is:");
 			printArray(a, n);
 			low=0;
@@ -101,7 +98,7 @@ public static void main(String args[])
 			printArray(a, n);
 
 		}catch(Exception e){e.printStackTrace();}
-                   
+		scan.close();
 	}
 }