qq_21431111的专栏

/************************************************************************//*                           归并排序 2014-9-30                         *//***************************************************

#include typedef int elemType;void selectSort(elemType *arr,int arrLength){int index=0;elemType currentMin;int positionOfMin;int i;elemType tempval;if (NULL == arr) retur

#include #include typedef int elemType;void insertSort(elemType *arr,int arrSize){assert(arr);int i,j,k;elemType tempval;for (i=0;i{j=i-1;k=0;tempval = arr[i];while(j

结果：#include #include #include #include #define NODEMAXSIZE 30typedef int ElemType;typedef struct Node{struct Node *left,*rigth,*parent;ElemType e;int weight;}HfmN

1.更相减损法2.辗转相除法3.遍历#include #include void swapint(int*n, int*m){ int temp = 0; temp = *n; *n=*m; *m=temp;}int getgcd1(int m, int n){ int i = 0; while( m%2 == 0 && n%2 == 0) { ++