FilesExpand file tree

 master

/

ReOrderArray_1.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

88 lines (63 loc) · 1.36 KB

 master

/

ReOrderArray_1.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

88 lines (63 loc) · 1.36 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

#include <iostream>

using namespace std;

void ReOrderArray(int* array, int length)

{

if(array == nullptr || length <= 0)

return ;

int front=0, end=length-1;

while(front < end)

{

while((array[front] & 0x01) && front < end ) //odd number

front++;

while(((array[end] & 0x01) == 0) && front < end) // even number

end--;

if(front < end)

{

int tmp = array[front];

array[front] = array[end];

array[end] = tmp;

}

}

}

// void ReOrderArray(int* array, int length)

// {

// if(array == nullptr || length<=1) return;

// int p1 = 0;

// int p2 = length-1;

// while(p1 < p2)

// {

// while(array[p1]%2 == 1)

// p1++;

// while(array[p2]%2 == 0)

// p2--;

// if(p1<p2)

// {

// int tmp = array[p1];

// array[p1] = array[p2];

// array[p2] = tmp;

// }

// }

// }

void PrintArray(int* array, int length)

{

for(int i=0; i<length; i++)

{

cout << array[i] << " " ;

}

cout << endl;

}

void Test1(void)

{

int array[10] = {1,2,3,4,5,6,7,8,9,10};

int length = sizeof(array)/sizeof(array[1]);

cout << "before reorder: ";

PrintArray(array, length);

ReOrderArray(array, 10);

cout << "after reorder: ";

PrintArray(array, length);

}

int main(void)

{

Test1();

return 0;

}