problem no 49:sorting problem:sort the array if the first half and the second half of the array is sorted.
QUESTION:
Given an integer array of which both
first half and second half are sorted. The task is to merge two sorted
halves of the array into a single sorted array.
Note: The two halves can be of arbitrary sizes.
Example 1:
Input:
N = 6
arr[] = {2 3 8 -1 7 10}
Output: -1 2 3 7 8 10
Explanation: {2 3 8} and {-1 7 10} are sorted
in the original array. The overall sorted
version is {-1 2 3 7 8 10}
Example 2:
Input:
N = 5
arr[] = {-4 6 9 -1 3}
Output: -4 -1 3 6 9
Explanation: {-4 -1} and {3 6 9} are sorted
in the original array. The overall sorted
version is {-4 -1 3 6 9}
ANSWER:
void sortHalves (int arr[], int n)
{
sort(arr,arr+n);
}
Comments
Post a Comment