Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

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}

**Your Task:**

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 <= 10^{5}

Login to report an issue on this page.

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

YesLoading...

Sort the Half Sorted

...