selsort.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 20 行

#include "..\book.h"

typedef int ELEM;
#include "..\swap.h"

// Insertion sort
void selsort(ELEM* array, int n) { // Selection Sort
  for (int i=0; i<n-1; i++) {      // Select i'th record
    int lowindex = i;              // Remember its index
    for (int j=n-1; j>i; j--)      // Find the least value
      if (key(array[j]) < key(array[lowindex]))
	lowindex = j;              // Put it in place
    swap(array[i], array[lowindex]);
  }
}

void sort(ELEM* array, int n) {
  selsort(array, n);
}