Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Sort the Half Sorted
Basic Accuracy: 31.55% Submissions: 187 Points: 1

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}

You don't need to read input or print anything. Your task is to complete the function sortHalves () which takes the array arr[] and its size n as inputs and modifies the array such that it gets sorted completely.

Expected Time Complexity: O(n).
Expected Auxiliary Space: O(n).

Constraints:
1 <= N <= 105

to report an issue on this page.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?