Sort all even numbers in the Array without changing order of odd elements
Last Updated :
11 Nov, 2021
Given an array arr[] of size N, the task is to sort all the even numbers in the array, without changing the order of odd elements
Examples:
Input: arr[] = {4, 7, 2, 11, 15}
Output: {2, 7, 4, 11, 15}
Explanation: Even numbers are sorted at their corresponding places, without changing the order of odd elements
Input: arr[] = {12, 6}
Output: {6, 12}
Approach: The task can be solved by segregating the even elements into another container say ‘evens‘, sort this container, and while iterating the array, replace the even elements with the sorted even elements stored in evens
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
void solve( int arr[], int n)
{
vector< int > evens;
for ( int i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
evens.push_back(arr[i]);
}
sort(evens.begin(), evens.end());
int l = 0;
for ( int i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
arr[i] = evens[l++];
}
for ( int i = 0; i < n; i++)
cout << arr[i] << " " ;
}
int main()
{
int N = 5;
int arr[N] = { 4, 7, 2, 11, 15 };
solve(arr, N);
return 0;
}
|
Java
import java.util.*;
public class GFG {
static void solve( int []arr, int n)
{
ArrayList<Integer> evens = new ArrayList<Integer>();
for ( int i = 0 ; i < n; i++) {
if (arr[i] % 2 == 0 )
evens.add(arr[i]);
}
Collections.sort(evens);
int l = 0 ;
for ( int i = 0 ; i < n; i++) {
if (arr[i] % 2 == 0 )
arr[i] = evens.get(l++);
}
for ( int i = 0 ; i < n; i++)
System.out.print(arr[i] + " " );
}
public static void main(String []args)
{
int N = 5 ;
int []arr = { 4 , 7 , 2 , 11 , 15 };
solve(arr, N);
}
}
|
Python3
def solve(arr, n):
evens = []
for i in range ( 0 , n):
if (arr[i] % 2 = = 0 ):
evens.append(arr[i])
evens.sort()
l = 0
for i in range ( 0 , n):
if (arr[i] % 2 = = 0 ):
arr[i] = evens[l]
l + = 1
for i in range ( 0 , n):
print (arr[i], end = " " )
if __name__ = = "__main__" :
N = 5
arr = [ 4 , 7 , 2 , 11 , 15 ]
solve(arr, N)
|
C#
using System;
using System.Collections.Generic;
class GFG {
static void solve( int []arr, int n)
{
List< int > evens = new List< int >();
for ( int i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
evens.Add(arr[i]);
}
evens.Sort();
int l = 0;
for ( int i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
arr[i] = evens[l++];
}
for ( int i = 0; i < n; i++)
Console.Write(arr[i] + " " );
}
public static void Main()
{
int N = 5;
int []arr = new int [] { 4, 7, 2, 11, 15 };
solve(arr, N);
}
}
|
Javascript
<script>
function solve(arr, n)
{
let evens = [];
for (let i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
evens.push(arr[i]);
}
evens.sort();
let l = 0;
for (let i = 0; i < n; i++) {
if (arr[i] % 2 == 0)
arr[i] = evens[l++];
}
for (let i = 0; i < n; i++)
document.write(arr[i] + " " );
}
let N = 5;
let arr = [ 4, 7, 2, 11, 15 ];
solve(arr, N);
</script>
|
Time Complexity: O(NlogN)
Auxiliary Space: O(N)
Share your thoughts in the comments
Please Login to comment...