Question:

Sorting the array in ascending order with Java

Summary:

We are given a random set of numbers with some ‘N’ numbers in it. Using java, we have to sort the numbers in ascending order and make a new array.

Solution:

//User function Template for Java

class Solution

{

public int[] merge(int[] left, int[] right){

int[] result = new int[left.length + right.length];

int i = 0, j = 0, k = 0;

while( i < left.length && j < right.length){

if(left[i] <= right[j]){

result[k] = left[i];

k++;

i++;

}else{

result[k] = right[j];

j++;

k++;

}

while(i < left.length){

result[k] = left[i];

i++;

k++;

}

while(j < right.length){

result[k] = right[j];

j++;

k++;

}

return result;

}

public int[] sortArr(int[] arr, int n)

{

if(n <= 1){

return arr;

}

int mid = n/2;

int[] left = new int[mid];

int[] right = new int[n-mid];

System.arraycopy(arr, 0, left, 0, mid);

System.arraycopy(arr, mid, right, 0, n-mid);

left = sortArr(left, mid);

right = sortArr(right, n - mid);

return merge(left, right);

}

Explanation:

This above code defines a class named Solution with two methods:

merge: This method takes two sorted arrays left and right as input and merges them into a single sorted array. It initialises an array result of size equal to the sum of the lengths of left and right. It then iterates through both arrays, comparing elements and placing them in the result array in sorted order. Finally, it returns the merged sorted array.

sortArr: This method takes an array arr and its length n as input and sorts the array using the merge sort algorithm. If the length of the array is less than or equal to 1, it returns the array as it is. Otherwise, it calculates the middle index mid of the array and creates two subarrays left and right by splitting the input array at the middle index. It recursively calls itself (sortArr) on both subarrays to sort them. Then, it merges the sorted left and right subarrays using the merge method and returns the merged sorted array.

In summary, this code implements the merge sort algorithm to sort an input array of integers. The merge method is responsible for merging two sorted arrays, while the sortArr method recursively applies the merge sort algorithm to sort the entire input array.

>How to save Python yaml and load a nested class?-Python

>How to send multiple HTML form fields to PHP arrays via Ajax?

>What is data binding in Angular?

>What is microservice architecture, and why is it better than monolithic architecture?

>What is pipe in Angular?

>What makes Python 'flow' with HTML nicely as compared to PHP?

>What to do when MQTT terminates an infinite loop while subscribing to a topic in Python?

>Creating custom required rule - Laravel validation