Remove elements to make array sorted
Given an array of integers, the task is to remove elements from the array to make array sorted. That is, remove the elements which do not follow an increasing order.
Examples:
Input: arr[] = {1, 2, 4, 3, 5, 7, 8, 6, 9, 10}
Output: 1 2 4 5 7 8 9 10Input: arr[] = {10, 12, 9, 5, 2, 13, 14}
Output: 10 12 13 14
Approach: Traverse the given array and for every element which is greater than or equal to the previously taken element, add this element to another array else skip to next element. In the end, the newly created array will be sorted according to Stalin sort.
- For each element check if the element is greater than the previous element or not.
- If yes then check for next element.
- Else remove that element.
- After all the elements have been traversed, we will get a sorted array.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to sort the array // by removing misplaced elements void removeElements(int arr[], int n) { // brr[] is used to store // the sorted array elements int brr[n], l = 1; brr[0] = arr[0]; for (int i = 1; i < n; i++) { if (brr[l - 1] <= arr[i]) { brr[l] = arr[i]; l++; } } // Print the sorted array for (int i = 0; i < l; i++) cout << brr[i] << " "; } // Driver code int main() { int arr[] = { 10, 12, 9, 10, 2, 13, 14 }; int n = sizeof(arr) / sizeof(arr[0]); removeElements(arr, n); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function to sort the array // by removing misplaced elements static void removeElements(int []arr, int n) { // brr[] is used to store // the sorted array elements int []brr = new int[n]; int l = 1; brr[0] = arr[0]; for (int i = 1; i < n; i++) { if (brr[l - 1] <= arr[i]) { brr[l] = arr[i]; l++; } } // Print the sorted array for (int i = 0; i < l; i++) System.out.print(brr[i] + " "); } // Driver code static public void main (String[] args) { int []arr = { 10, 12, 9, 10, 2, 13, 14 }; int n = arr.length; removeElements(arr, n); } } // This code is contributed by Code_Mech. |
chevron_right
filter_none
Python3
# Python3 implementation of the approach # Function to sort the array # by removing misplaced elements def removeElements(arr, n) : # brr[] is used to store # the sorted array elements brr = [0]*n; l = 1; brr[0] = arr[0]; for i in range(1,n) : if (brr[l - 1] <= arr[i]) : brr[l] = arr[i]; l += 1; # Print the sorted array for i in range(l) : print(brr[i],end=" "); # Driver code if __name__ == "__main__" : arr = [ 10, 12, 9, 10, 2, 13, 14 ]; n = len(arr); removeElements(arr, n); # This code is contributed by AnkitRai01 |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { // Function to sort the array // by removing misplaced elements static void removeElements(int []arr, int n) { // brr[] is used to store // the sorted array elements int []brr = new int[n]; int l = 1; brr[0] = arr[0]; for (int i = 1; i < n; i++) { if (brr[l - 1] <= arr[i]) { brr[l] = arr[i]; l++; } } // Print the sorted array for (int i = 0; i < l; i++) Console.Write(brr[i] + " "); } // Driver code static public void Main () { int []arr = { 10, 12, 9, 10, 2, 13, 14 }; int n = arr.Length; removeElements(arr, n); } } // This code is contributed by jit_t |
chevron_right
filter_none
Output:
10 12 13 14
Recommended Posts:
- Remove elements to make array satisfy arr[ i+1] < arr[i] for each valid i
- Check if reversing a sub array make the array sorted
- Remove duplicates from sorted array
- Maximum in an array that can make another array sorted
- Maximum number of partitions that can be sorted individually to make sorted
- Make alphabets using the elements of an array
- Remove elements from the array which appear more than k times
- Remove minimum elements from array so that max <= 2 * min
- Remove duplicate elements in an Array using STL in C++
- Minimum array element changes to make its elements 1 to N
- Make all elements of an array equal with the given operation
- Minimum gcd operations to make all array elements one
- Minimum delete operations to make all elements of array same
- Minimum no. of operations required to make all Array Elements Zero
- Minimum replacements to make elements of a ternary array same
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.
- Count array elements that divide the sum of all other elements
- Maximum element in a sorted and rotated array
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Find two numbers whose divisors are given in a random order
- Maximum sum such that no two elements are adjacent | Set 2
