选择排序——重组数组

 

#include<stdio.h>
#include<string.h>
void sort(int arr[], int len)
{
	int ipos, itemp;
	for (int i = 0; i < len; i++)
	{
		itemp = arr[i];
		ipos = i;
		for (int j = i + 1; j < len; j++) {
			if (arr[j] > itemp){       //运用选择排序    
				itemp = arr[j];
				ipos = j;
			}
		}
		arr[ipos] = arr[i];
		arr[i] = itemp;
	}
}
int main() {
	int news[] = {0};
	int arr[] = {85,89,14,60,14,15,68,65,92,36};
	int len = sizeof(arr) / sizeof(arr[0]);
	sort(arr, len);
	int left = 0, right = len-1;
	for (int i = 0; i < len; i++) {
		if (i % 2 == 0) {
			news[left] = arr[i];
			left++;
		}
		else
		{
			news[right] = arr[i];
			right--;
		}
	}
	for (int i = 0; i < len; i++) {
		printf("%d ", news[i]);
	}
	return 0;
}