不改变正负数相对顺序的重新排列

//不改变正负数相对顺序的重新排列

#include<iostream>
using namespace std;


void partition_no_change(int *s, int length)
{
int j;
int p = 0;
for (j = length - 1;j>p;)
{
if (s[j] < 0)
{
int i = j;
while (i != 0)
{
int temp = s[i - 1];
s[i - 1] = s[i];
s[i] = temp;
i--;
}
p++;
}
else
j--;
}
}


//测试程序：

int main()
{
int s[] = { 1, 7, -5, -12, -13, 99, -6, 31, 15 };
int num = sizeof(s) / sizeof(s[0]);
partition_no_change(s, num);
for (int i = 0; i < num; i++)
{
cout << s[i] << " ";
}
return 0;
}