Select Sort Algorithm
2014-02-08 20:13
253 查看
//选择排序算法
#include <stdlib.h> #include <stdio.h> #include <math.h> #define max_num 100 #define SWAP(X, Y, TEMP) ((TEMP = X), (X = Y), (Y = TEMP)) int main(int argc, char *argv[]) { int list[max_num]; int i, j, num, min, temp; printf("Please input number:"); scanf("%d", &num); if (num < 0 || num > max_num) { fprintf(stderr, "invalid data\n"); exit(1); } for (i = 0; i < num; i++) { list[i] = rand() % 1000; printf("%d ", list[i]); } printf("\n"); for (i = 0; i < num; i++) { min = i; for (j = i + 1; j < num; j ++) { if (list[j] < list[min]) min = j; } SWAP(list[i], list[min], temp); } printf("After select sort result:\n"); for (i = 0; i < num; i ++) printf("%d ", list[i]); printf("\n"); }
相关文章推荐
- Algorithm intro - Select Sort
- Sort Algorithm-->Select Sort
- select sort algorithm
- 快速排序与快速选择算法(quick sort and quick select algorithm)
- Five kinds of sort algorithm
- select sort
- Algorithm: Quick Sort Mind and Related Questions
- 算法----选择排序(select sort)
- algorithm的sort排序函数
- 选择排序 Selecttion Sort
- #include <algorithm>中sort的一般用法
- Algorithm.Sort (各类排序)
- implementation of General Sort Algorithm - mark
- 选择排序(select sort)
- MySQL Select and Sort Status Variables
- Algorithm_1_Insertion_Sort
- One Algorithm A Day --- INSERTION-SORT--算法入门
- Algorithm: Quick Sort Mind and Related Questions
- Sort algorithm overview.
- 为什么自己写的快速排序要比algorithm命名空间下的sort要慢?