Sorting by category

An array contains three types of numbers: Negative, zero, and positive. You must scan the array only once, that is, divide the array into three parts: Negative, zero, and positive. I tried to write the code.

# Include <stdio. h ># define N 9 void swap (int * p, int * q) {int temp; temp = * p; * p = * q; * q = temp; return ;} int main () {int array [N] = {-1,-3, 0,-2, 2,-2, 0, 1}; int * p_neg, * p, * p_pos; for (p_neg = & array [0], p = & array [0], p_pos = & array [N-1]; p <= p_pos; p ++) {if (* p <0) {swap (p, p_neg); p_neg ++;} if (* p> 0) {swap (p, p_pos); p_pos --; p --;}};}

This article is from the "gifted birds and eggs" blog, please be sure to keep this source http://curely.blog.51cto.com/1627940/1297308