# Sorting array except elements in a subarray

Given an array A positive integers, sort the array in ascending order such that element in given subarray (start and end indexes are input) in unsorted array stay unmoved and all other elements are sorted.

Examples :

Input : arr[] = {10, 4, 11, 7, 6, 20}
l = 1, u = 3
Output : arr[] = {6, 4, 11, 7, 10, 20}
We sort elements except arr[1..3] which
is {11, 7, 6}.

Input : arr[] = {5, 4, 3, 12, 14, 9};
l = 1, u = 2;
Output : arr[] = {5, 4, 3, 9, 12, 14 }
We sort elements except arr[1..2] which
is {4, 3}.

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach : Copy all elements except the given limit of given array to another array. Then sort the other array using a sorting algorithm. Finally again copy the sorted array to original array. While copying, skip given subarray.

## C++

 // CPP program to sort all elements except  // given subarray. #include using namespace std;    // Sort whole array a[] except elements in // range a[l..r] void sortExceptUandL(int a[], int l, int u, int n) {     // Copy all those element that need     // to be sorted to an auxiliary      // array b[]     int b[n - (u - l + 1)];     for (int i = 0; i < l; i++)           b[i] = a[i];     for (int i = u+1; i < n; i++)           b[l + (i - (u+1))] = a[i];            // sort the array b     sort(b, b + n - (u - l + 1));        // Copy sorted elements back to a[]     for (int i = 0; i < l; i++)           a[i] = b[i];     for (int i = u+1; i < n; i++)           a[i] = b[l + (i - (u+1))];  }    // Driver code int main() {     int a[] = { 5, 4, 3, 12, 14, 9 };     int n = sizeof(a) / sizeof(a[0]);     int l = 2, u = 4;     sortExceptUandL(a, l, u, n);     for (int i = 0; i < n; i++)         cout << a[i] << " "; }

## Java

 // Java program to sort all elements except  // given subarray. import java.util.Arrays; import java.io.*;    public class GFG {            // Sort whole array a[] except elements in     // range a[l..r]     public static void sortExceptUandL(int a[],                            int l, int u, int n)     {                    // Copy all those element that need         // to be sorted to an auxiliary          // array b[]         int b[] = new int[n - (u - l + 1)];                    for (int i = 0; i < l; i++)              b[i] = a[i];         for (int i = u+1; i < n; i++)              b[l + (i - (u+1))] = a[i];                 // sort the array b         Arrays.sort(b);            // Copy sorted elements back to a[]         for (int i = 0; i < l; i++)              a[i] = b[i];         for (int i = u+1; i < n; i++)              a[i] = b[l + (i - (u+1))];      }     // Driver code     public static void main(String args[])     {         int a[] = { 5, 4, 3, 12, 14, 9 };         int n = a.length;         int l = 2, u = 4;                    sortExceptUandL(a, l, u, n);                    for (int i = 0; i < n; i++)             System.out.print(a[i] + " ");     } }    // This code is contributed by Manish Shaw // (manishshaw1)

## Python3

 # Python3 program to sort all elements # except given subarray.    # Sort whole array a[] except elements in # range a[l..r] def sortExceptUandL(a, l, u, n) :            # Copy all those element that need     # to be sorted to an auxiliary      # array b[]     b = [0] * (n - (u - l + 1))            for i in range(0, l) :         b[i] = a[i]                for i in range(u+1, n) :         b[l + (i - (u+1))] = a[i]         # sort the array b     b.sort()        # Copy sorted elements back to a[]     for i in range(0, l) :         a[i] = b[i]                for i in range(u+1, n) :         a[i] = b[l + (i - (u+1))]    # Driver code a = [ 5, 4, 3, 12, 14, 9 ] n = len(a) l = 2 u = 4 sortExceptUandL(a, l, u, n)    for i in range(0, n) :     print ("{} ".format(a[i]), end="")        # This code is contributed by # Manish Shaw (manishshaw1)

## C#

 // C# program to sort all elements except  // given subarray. using System; using System.Collections.Generic;    class GFG {            // Sort whole array a[] except elements in     // range a[l..r]     static void sortExceptUandL(int []a, int l,                                  int u, int n)     {                    // Copy all those element that need         // to be sorted to an auxiliary          // array b[]         int[] b = new int[n - (u-l+1)];                    for (int i = 0; i < l; i++)              b[i] = a[i];                        for (int i = u+1; i < n; i++)              b[l + (i - (u+1))] = a[i];                 // sort the array b         Array.Sort(b, 0, n - (u - l + 1));                // Copy sorted elements back to a[]         for (int i = 0; i < l; i++)              a[i] = b[i];                        for (int i = u+1; i < n; i++)              a[i] = b[l + (i - (u+1))];      }            // Driver code     public static void Main()     {         int []a = { 5, 4, 3, 12, 14, 9 };         int n = a.Length;         int l = 2, u = 4;                    sortExceptUandL(a, l, u, n);                    for (int i = 0; i < n; i++)             Console.Write(a[i] + " ");     } }    // This code is contributed by Manish Shaw  // (manishshaw1)

## PHP



Output :

4 5 3 12 14 9

GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : manishshaw1

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.