From 91e6df13ce1b67412b1696b9fbd1aa4e4d221263 Mon Sep 17 00:00:00 2001
From: Sourav Palit <souravpalitrana@gmail.com>
Date: Fri, 18 Jun 2021 12:15:57 +0600
Subject: [PATCH] Remove unused method

---
 .../MergeSortedArraysOptimized.java           | 38 -------------------
 1 file changed, 38 deletions(-)

diff --git a/Heap/MergeSortedArrays/src/mergesortedarrays/MergeSortedArraysOptimized.java b/Heap/MergeSortedArrays/src/mergesortedarrays/MergeSortedArraysOptimized.java
index e130e3e..285b2d4 100644
--- a/Heap/MergeSortedArrays/src/mergesortedarrays/MergeSortedArraysOptimized.java
+++ b/Heap/MergeSortedArrays/src/mergesortedarrays/MergeSortedArraysOptimized.java
@@ -70,42 +70,4 @@ public static List<Integer> mergeSortedArrays(List<List<Integer>> arrays) {
         
         return sortedArrays;
     }
-    
-    public static List<Integer> mergeSortedArraysAlternate1(List<List<Integer>> arrays) {
-        ArrayList<Integer> sortedArrays = new ArrayList<Integer>();
-        
-        int maxLength = findMaxLength(arrays);
-        
-        for (int i = 0; i < maxLength; i++) {
-            
-            
-            ArrayList<Integer> newHeapValues = new ArrayList<Integer>();
-            for (int j = 0; j < arrays.size(); j++) {
-                if (i < arrays.get(j).size()) {
-                    newHeapValues.add(arrays.get(j).get(i));
-                }
-            }
-            
-            if (newHeapValues.size() > 0) {
-                 MinHeap minHeap = new MinHeap(newHeapValues);
-                 while (minHeap.heap.size() > 0) {
-                    sortedArrays.add(minHeap.remove());
-                 }
-            }
-        }
-        
-        return sortedArrays;
-    }
-    
-    private static int findMaxLength(List<List<Integer>> arrays) {
-        int maxLength = 0;
-        
-        for (List<Integer> array : arrays) {
-            if (array.size() > maxLength) {
-                maxLength = array.size();
-            }
-        }
-        
-        return maxLength;
-    }
 }