FilesExpand file tree

 master

/

ReOrderArray_2.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

81 lines (60 loc) · 1.08 KB

 master

/

ReOrderArray_2.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

81 lines (60 loc) · 1.08 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

#include <iostream>

using namespace std;

typedef bool Fun(int);

//判断正负数

bool function1(int data)

{

if(data < 0)

return true;

else

return false;

}

//能否被３整除

bool function2(int data)

{

if(data%3 == 0)

return true;

else

return false;

}

void ReOrderArray(int* array, int length, Fun* fun)

{

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

int p1 = 0;

int p2 = length-1;

while(p1 < p2)

{

while(p1 < p2 && fun(array[p1]))

p1++;

while(p1 < p2 && !fun(array[p2]))

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, function1);

cout << "after reorder: ";

PrintArray(array, length);

}

int main(void)

{

Test1();

}