random

Author: anuragkmr45

array/sorting/MergeSort.java

@@ -1,5 +1,6 @@
 package array.sorting;
 
+import java.util.ArrayList;
 import java.util.Arrays;
 
 public class MergeSort {
@@ -16,18 +17,18 @@ static int[] mergeSort(int[] array){
         return merge(left, right );
     }
 
-    static int[] merge(int[] first,  int[] second) {
+    static int[] merge(int[] first, int[] second) {
         int[] mix = new int[first.length + second.length];
 
         int i = 0;
         int j = 0;
         int k = 0;
 
         while (i < first.length && j < second.length) {
-            if (first[i] < second[j]){
+            if (first[i] < second[j]) {
                 mix[k] = first[i];
                 i++;
-            }else {
+            } else {
                 mix[k] = second[j];
             }
             k++;
@@ -49,4 +50,5 @@ static int[] merge(int[] first,  int[] second) {
 
         return mix;
     }
+
 }

collectionFramework/IteratorS.java

@@ -17,17 +17,20 @@ public static void main(String[] args) {
         // display using iterator
         Iterator<String> itr = list.iterator();
 
+        System.out.println("Display using iterator : ");
         while (itr.hasNext()) {
             String item = itr.next();
-            System.out.println(item + " ");
+            System.out.print(item + " ");
         }
 
+        System.out.println();
         // modify using iterator
         ListIterator<String> lsItr = list.listIterator();
 
+        System.out.println("Modify using iterator : ");
         while (lsItr.hasNext()) {
             String item = lsItr.next();
-            System.out.println(item + " ");
+            System.out.print(item + " ");
         }
 
     }

collectionFramework/LL.java renamed to linkedList/collectionFramework/LL.java

@@ -1,4 +1,4 @@
-package collectionFramework;
+package linkedList.collectionFramework;
 
 import java.util.LinkedList;