Coder Calvin at Work

void insertionSortBinary(TYPE A[], int n){ int i, j, l, r, mid; TYPE key; for(i = 1; i<n; ++i) { key = A[i]; l = 0; r = i-1; while(l <= r) { mi

#define MAX 9999999void mergeMAX(TYPE A[], int p, int q, int r){ int n1 = q-p+1, i, j, k; int n2 = r-q; TYPE L[N/2 + 2], R[N/2+2]; for(i = 0; i < n1; ++i) L[i] = A[p+i]; L[i] = MAX;

#include #include #include typedef int TYPE;#define N 100000void exchange(TYPE A[], int a, int b){TYPE tmp = A[a]; A[a] = A[b]; A[b] = tmp;}void selectionSort(TYPE A[], int n){ int i, j,

typedef int TYPE;#define N 100void exchange(TYPE A[], int a, int b){TYPE tmp = A[a]; A[a] = A[b]; A[b] = tmp;}void selectionSort(TYPE A[], int n){ int i, j, minIndex; for(i = 0; i < n-1;

//// main.c// FirstProgram//// Created by Calvin Zang on 12-4-17.// Copyright (c) 2012年 SYSU. All rights reserved.//#include #include #include typedef int TYPE;#define N 100void inse

//// main.c// FirstProgram//// Created by Calvin Zang on 12-4-17.// Copyright (c) 2012年 SYSU. All rights reserved.//#include //for test#include //#include //rand//#define N 1000#def

void deleteBlank(char str[]){ int len = strlen(str), i, j, p, s, e = len; for(i = 0; i < len; ++i) { if(str[i] != ' ')continue; if(str[i+1] == ' ') p = i+1; for(j

#define min(a,b) (((a)<(b)) ? (a) : (b))int stringDistance(char strA[], int pABegin, int pAEnd, char strB[], int pBBegin, int pBEnd){ if(pABegin > pAEnd){ if(pBBegin > pBEnd) return 0;

#include #include #include typedef int TYPE;#define N 100void exchange(TYPE A[], int i, int j){TYPE tmp = A[i]; A[i]=A[j];A[j]=tmp;}void bubbleSort(TYPE A[], int n){ int i, j; for(i =

typedef struct Nodetag{TYPE val; struct Nodetag * next;} Node;typedef Node* pNode;Node* combine(Node* p1, Node* p2){ Node *head, *p; if(p1 == NULL) return p2; if(p2 == NULL) return p1;

#include #include #include #include //#include //using namespace std;typedef int TYPE;typedef struct NODETAG{ struct NODETAG* pNext; TYPE value;}NODE;NODE* build(TYPE A[], int n)