Merge pull request thuva4#182 from Sudeepa14/master

thuva4 · web-flow · commit f5e0b187d4b0 · 2017-10-12T11:35:02.000+05:30
Removed unwanted comments
diff --git a/MergeSort/Java/MergeSort.java b/MergeSort/Java/MergeSort.java
@@ -1,5 +1,3 @@
-package com.dev.namhoai.sort;
-
 public class MergeSort {
 
     public static void sort(int[] a) {
diff --git a/insertionsort.js b/insertionsort.js
@@ -1,9 +1,10 @@
-/*In insertion sort, we divide the initial unsorted array into two parts;
-* sorted part and unsorted part. Initially the sorted part just has one
-* element (Array of only 1 element is a sorted array). We then pick up
-* element one by one from unsorted part; insert into the sorted part at
-* the correct position and expand sorted part one element at a time.
+/*In insertion sort, we divide the initial unsorted array into two parts;		 +
+ * sorted part and unsorted part. Initially the sorted part just has one		
+ * element (Array of only 1 element is a sorted array). We then pick up		
+ * element one by one from unsorted part; insert into the sorted part at		
+ * the correct position and expand sorted part one element at a time.		
 */
+
 function insertionSort(unsortedList) {
   var len = unsortedList.length;
   for (var i = 1; i < len; i++) {
@@ -21,4 +22,4 @@ function insertionSort(unsortedList) {
 
 var arr = [5, 3, 1, 2, 4, 8, 3, 8];
 insertionSort(arr);
-console.log(arr);
+console.log(arr);
