算法导论2.1-2.2

#include <stdio.h> #include <stdlib.h> #include <time.h> //插入排序 void insertsort(int A[], int n) { int i,j; int iTemp; for (i = 1; i <= n-1;++i) { iTemp = A[i]; for (j = i - 1; j >=0 && A[j] >iTemp ;--j) A[j+1] = A[j]; A[j+1] = iTemp; } } //插入排序 void insertsort1(int A[],int n) { int i,j; int iTemp; for (i = 1; i<= n-1; ++i) { iTemp = A[i]; j = i-1; while (j >= 0 && A[j] > iTemp) { A[j+1] = A[j]; --j; } A[j+1] = iTemp; } } //选择排序 void selectsort(int A[], int n) { int i,j; int iMin; for (i = 0; i <= n-1; ++i) { iMin = A[i]; for (j = i+1; j <= n-1; ++j) { if (iMin > A[j]) iMin = A[j],A[j] = A[i],A[i] = iMin; } } } //顺序查找 int isFind(int A[], int n,int x) { int i; for (i = 0; i < n; ++i) { if (x == A[i]) return i; } return -1; } void add(int A[],int B[],int C[],int n) { int i; int iCarry;//进位 int iTemp; iCarry = 0; for (i = 0; i < n; ++i) { iTemp = A[n-i-1] + B[n-i-1] +iCarry; C[n-i] = iTemp % 2 + '0'; iCarry = iTemp/2; } C[0] = iCarry + '0'; } int main() { int i; int A[10]; srand(time(NULL)); for (i = 0; i < 10; ++i) { A[i] = rand() % 20; printf("%d ",A[i]); } printf("/n"); selectsort(A,10); for (i = 0; i < 10; ++i) printf("%d ",A[i]); printf("/n"); printf("%d ",isFind(A,10,3)); return 0; }