数据结构
zhaohan7
无
展开
-
求2个数的最大公约数
int fun(int m, int n){ while(m != n) { if(m > n) m = m - n; else n = n -m; } return m;}原创 2007-09-11 20:49:00 · 462 阅读 · 0 评论 -
简单选择排序
#include #include void Sort(){ int data[10] = { 2, 3, 5, 65, 25, 64, 32, 75, 23, 0 }; for (int n = 0; n { printf("%d ", data[n]); } printf("/n"); int temp = 0; f原创 2007-09-29 16:40:00 · 427 阅读 · 0 评论 -
快速排序
#include #include void QuickSort(int *array, int low, int high){ if(low { int _low = low; int _high = high + 1; int provit = array[low]; int temp = 0; while (原创 2007-10-09 09:53:00 · 376 阅读 · 0 评论 -
折半查找
#include stdio.h>#include stdlib.h>int Search2(int *array, int low, int high, int key)...{ int mid = 0; if (low high) ...{ mid = (low + high) / 2; if (key == array[mid])原创 2007-10-09 14:11:00 · 414 阅读 · 0 评论