数组排序使得数组负数在正数左边且按照原来的顺序

 1 #include "stdafx.h"
 2 #include <iostream>
 3 using namespace std;
 4 
 5 void SplitNumber(int* A, int size);
 6 void PrintArray(int* A, int size);
 7 
 8 int _tmain(int argc, _TCHAR* argv[])
 9 {
10     int A[] = { 0, 2, -2, 3, -3, 4, 5, 7, -10 };
11     int size = sizeof(A) / sizeof(int);
12     PrintArray(A, size);
13     SplitNumber(A, size);
14     PrintArray(A, size);
15 
16     return 0;
17 }
18 
19 
20 void PrintArray(int* A, int size)
21 {
22     for (size_t i = 0; i < size; i++)
23     {
24         cout << A[i] << " ";
25     }
26     cout << endl;
27 }
28 
29 void SplitNumber(int* A, int size)
30 {
31     int posIndex=-1, negIndex=-1;
32     for (size_t i = 0; i < size; i++)
33     {
34         if (negIndex==-1)
35         {
36             if (A[i]<0 && posIndex >= 0)
37             {
38                 negIndex = i;
39             }
40             if (A[i]>0 && posIndex < 0)
41             {
42                 posIndex = i;
43             }
44         }
45         if (negIndex>=0&&posIndex>=0)
46         {
47             int tmp = A[i];
48             for (size_t i = negIndex; i >posIndex; i--)
49             {
50                 A[i] = A[i - 1];
51             }
52             A[posIndex] = tmp;
53             posIndex++;
54             negIndex = -1;
55         }
56     }
57 }