select sort algorithm
2010-03-04 11:50
357 查看
void select_sort(int a[], int len) { int i, j; int min; for(j = 0; j < len-1; j++){ min = j; for(i = j+1; i < len; i++) if(a[i] < a[min]) min = i; swap(a, min, j); } }
相关文章推荐
- Algorithm intro - Select Sort
- Select Sort Algorithm
- Sort Algorithm-->Select Sort
- 快速排序与快速选择算法(quick sort and quick select algorithm)
- [Data Structure & Algorithm]Sort Algorithms
- 000-algorithm-quick_sort
- Sort Algorithm Part-2 Insertion Sort
- Algorithm 4_Heap_Sort
- One Algorithm A Day --- INSERTION-SORT--算法入门
- Introduction to Algorithm - Summary of Chapter 6 - Heapsort
- Introduction to Algorithm - Summary of Chapter 2(1) - Insertion sort
- #include <algorithm>中sort的一般用法
- Sort Algorithm 总结
- Quick Select Algorithm 快速选择算法
- Algorithm Intro - Radix Sort
- classic problem: select sort-java
- 数据结构基础(1) --Swap & Bubble-Sort & Select-Sort
- Algorithm: Quick Sort Mind and Related Questions
- #include <algorithm>中sort的一般用法
- select sort O(n2)