选择排序总结

简单选择排序:

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
int main (void) {
	int num;
	int arr[100];
	while (scanf ("%d", &num) != EOF) {
		for (int i = 0;i < num;i++) {
			scanf ("%d", &arr[i]);
		}
		
		int min;
		int index;
		for (int i = 0;i < num;i++) {
			min = 10000;
			
			for (int j = i;j < num;j++) {
				if (min > arr[j]) {
					min = arr[j];
					index = j;
				}
			}
			if (index != i) {
				int temp = arr[index];
				arr[index] = arr[i];
				arr[i] = temp;
			}
		}
		
		for (int i = 0;i < num;i++) {
			printf ("%d ", arr[i]);
		}
		printf ("\n");
	}
	return 0;
}

树形选择排序:

/*
 	树形选择排序 
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <math.h>
using namespace std;
int main (void) {
	
	int num;
	int arr[100];
	while (scanf ("%d", &num) != EOF) {
		for (int i = 0;i < num;i++) {
			scanf ("%d", &arr[i]);
		}
		
		int tier = 1;
		int Count = 1;
		while (Count < num) {
			Count *= 2;
			tier++;
		}
		
		int k = pow (2, tier)-1;
		int k1 = pow (2, tier-1) -1;
		int *parr = (int*) malloc (sizeof (int) * (k+1));
		
		for (int i = 0;i < num;i++) {
			parr[i+k1+1] = arr[i]; 
		}
		
		for (int i = num+1+k1;i <= k;i++) {
			parr[i] = 10000;
		}
		
		for (int i = 0;i < num;i++) {
			for (int j = k;j >= 1;j -= 2) {
				parr[j/2] = parr[j] > parr[j-1] ? parr[j-1] : parr[j];
			}
			printf ("%d ", parr[1]);
			
			for (int j = k1+1;j < k1+1+num;j++) {
				if (parr[j] == parr[1]) {
					parr[j] = 10000;
					break;
				}
			}
		}
		printf ("\n");
	}
	return 0;
	
}