[问题描述]

将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N）

[输入]

待排序记录个数，各关键字的值。

[输出]

关键字从正负分开，正数在前

[存储结构]

待排序记录顺序存储。

[算法的基本思想]

快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。

#include <iostream>

using namespace std



#define MAXNUM 100//设文件的最长可能长度





void sort(int* keys, const int len)//排序

-[Problem Descr iption] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword integral to the entire sequence record. keyword so that all non-negative Records with the keyword for the record before negative.# Include