Merge Sort Algorithm Explained and Implemented with Examples in Java | Sorting Algorithms | Geekific

[@FluteVJ]

At 5:50 you can improvise the code by using Arrays.copyOfRange() like below. It will be more concise. Pls correct me if I'm wrong. T[] leftArray = Arrays.copyOfRange(arr, low, mid+1); T[] rightArray = Arrays.copyOfRange(arr, mid+1, high+1);

[@geekific]

Well done!

[@TechOnScreen]

gr8 work, good explanation.