一、二分查找
1、形参是数组,实参是数组名,使用数组元素直接访问
#include <stdio.h> const int N=5; int binarySearch(int x[], int n, int item); int main() { int a[N]={1,5,6,17,29}; int i,index, key; printf("数组a中的数据:\n"); for(i=0;i<N;i++) printf("%d ",a[i]); printf("\n"); printf("输入待查找的数据项: "); scanf("%d", &key); index=binarySearch(a,N,key) ; if(index>=0) printf("%d在数组中,下标为%d\n", key, index); else printf("%d不在数组中\n", key); return 0; } int binarySearch(int x[], int n, int item) { int low, high, mid; low = 0; high = n-1; while(low <= high) { mid = (low+high)/2; if (item == x[mid]) return mid; else if(item<x[mid]) high = mid - 1; else low = mid + 1; } return -1; }
2、形参是指针变量,实参是数组名,使用指针变量间接访问方式实现
#include <stdio.h> const int N=5; int binarySearch(int *x, int n, int item); int main() { int a[N]={2,23,26,45,67}; int i,index, key; printf("数组a中的数据:\n"); for(i=0;i<N;i++) printf("%d ",a[i]); printf("\n"); printf("输入待查找的数据项: "); scanf("%d", &key); index=binarySearch(a,N,key); if(index>=0) printf("%d在数组中,下标为%d\n", key, index); else printf("%d不在数组中\n", key); return 0; } int binarySearch(int *x, int n, int item) { int low, high, mid; low = 0; high = n-1; while(low <= high) { mid = (low+high)/2; if (item == *(x+mid)) return mid; else if(item<*(x+mid)) high = mid - 1; else low = mid + 1; } return -1; }
#include <stdio.h> #include <string.h> void selectSort(char str[][20], int n ); // 函数声明,形参str是二维数组名 int main() { char name[][20] = {"Jo", "Ax", "Joph", "Cay", "Gge"}; int i; printf("输出初始名单:\n"); for(i=0; i<5; i++) printf("%s\n", name[i]); selectSort(name, 5); // 调用选择法对name数组中的字符串排序 printf("按字典序输出名单:\n"); for(i=0; i<5; i++) printf("%s\n", name[i]); return 0; } // 函数定义 // 函数功能描述:使用选择法对二维数组str中的n个字符串按字典序排序 void selectSort(char str[][20], int n) { int i, j, k; char temp[20]; for(i=0; i<n-1; i++) { k = i; // k用于记录当前最小元素的下标 for(j=i+1; j<n; j++) if (strcmp(str[j],str[k])<0) k = j; // 如果str[j]比当前最小元素还要小,就更新k,确保它总是存放最小元素的下标 if(k != i) { // 找到最小元素后,交换str[i]和str[k] strcpy(temp,str[i]); strcpy(str[i],str[k]); strcpy(str[k],temp); } } }
感觉好难,