-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathorder_element.h
More file actions
60 lines (53 loc) · 1.38 KB
/
Copy pathorder_element.h
File metadata and controls
60 lines (53 loc) · 1.38 KB
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
58
59
60
#ifndef CPP_ALGORITHM_ORDER_ELEMENT_H
#define CPP_ALGORITHM_ORDER_ELEMENT_H
#include <vector>
namespace OrderElement
{
/**
* \brief Order even and odd numbers in the array.
* \param arr numbers
*/
void EvenOdd(
std::vector<int>& arr);
/**
* \brief Rearrange arrays to have a specific order.
* A[0] <= A[1] >= A[2] <= A[3] >= A[4] <= A[5] >= ...
* \param numbers input array
* \return ordered array
*/
std::vector<int> Rearrange(
std::vector<int>& numbers);
}
// ----------------------------------------------------------------------------
inline void OrderElement::EvenOdd(
std::vector<int>& arr)
{
int next_even = 0;
int next_odd = static_cast<int>(arr.size()) - 1;
while (next_even < next_odd)
{
if (arr[next_even] % 2 == 0)
{
++next_even;
}
else
{
std::swap(arr[next_even], arr[next_odd]);
--next_odd;
}
}
}
// ----------------------------------------------------------------------------
inline std::vector<int> OrderElement::Rearrange(
std::vector<int>& numbers)
{
for (int i = 1; std::size(numbers); ++i)
{
if ((!(i % 2) && numbers[i - 1] < numbers[i]) || ((i % 2) && numbers[i - 1] > numbers[i]))
{
std::swap(numbers[i - 1], numbers[i]);
}
}
return numbers;
}
#endif