Merge pull request neetcode-gh#2480 from Anukriti167/patch-5

Create 0912-sort-an-array

java/0912-sort-an-array

@@ -0,0 +1,41 @@
+class Solution {
+ //Using Merge Sort
+ public int[] sortArray(int[] nums) {
+ mergeSort(nums, 0, nums.length-1);
+ return nums;
+ }
+ public void mergeSort(int []arr, int low, int high){
+ if(low >= high) return;
+
+ int mid = (low+high)/2;
+ mergeSort(arr, low, mid);
+ mergeSort(arr, mid+1, high);
+ merge(arr, low, high, mid);
+ }
+ public void merge(int []arr, int low, int high, int mid){
+ ArrayList<Integer> temp = new ArrayList<>();
+ int left = low;
+ int right = mid+1;
+
+ while(left <= mid && right <= high){
+ if(arr[left] <= arr[right]){
+ temp.add(arr[left]);
+ left++;
+ }else{
+ temp.add(arr[right]);
+ right++;
+ }
+ }
+ while(left <= mid){
+ temp.add(arr[left]);
+ left++;
+ }
+ while(right <= high){
+ temp.add(arr[right]);
+ right++;
+ }
+ for(int i=low; i<= high; i++){
+ arr[i] = temp.get(i-low);
+ }
+ }
+}