-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstoringElementsAccordingTo_oddEven.cpp
More file actions
58 lines (50 loc) · 1012 Bytes
/
Copy pathstoringElementsAccordingTo_oddEven.cpp
File metadata and controls
58 lines (50 loc) · 1012 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include<bits/stdc++.h>
using namespace std;
int *storingOddEven(int *arr, int n)
{
vector<int> even;
vector<int> odd;
// for even
for(int i=0; i<n; i++)
{
if(i % 2 == 0)
even.push_back(arr[i]);
else
odd.push_back(arr[i]);
}
sort(even.begin(), even.end());
sort(odd.begin(), odd.end(), greater<int>());
int j = 0;
int k = 0;
for(int i=0; i<n; i++)
{
if(i % 2 == 0)
{
arr[i] = even[j];
j++;
}
else
{
arr[i] = odd[k];
k++;
}
}
return arr;
}
int main()
{
int n;
cout<<"\nEnter the Array Size: ";
cin>>n;
int arr[n];
cout<<"Enter the Array Elements: ";
for(int i=0; i<n; i++)
cin>>arr[i];
int *res;
res = storingOddEven(arr, n);
cout<<"\nSorted Array Elements are: ";
for(int i=0; i<n; i++)
cout<<res[i]<<" ";
cout<<"\n\n";
return 0;
}