# C++ Program for 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}. ```

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);` `    ``int` `l = 2, u = 4;` `    ``sortExceptUandL(a, l, u, n);` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``cout << a[i] << ``" "``;` `}`

Output :

`4 5 3 12 14 9`

Time Complexity: O(n*log(n))
Auxiliary Space: O(n)

Please refer complete article on Sorting array except elements in a subarray for more details!

Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Previous
Next