- 博客(13)
- 资源 (11)
- 收藏
- 关注
RSS订阅原创 快速排序
#include #include int partition(int*, int, int);void qSort(int*, int, int);void swap(int*, int*);int main(void){ int i; int array[] = {11, 5, 20, 5, 100, 88, -987, 666, 0, 11, 11
2012-03-30 23:26:18
295
原创 棋盘覆盖
/* 0 0 0 1 2*/#include #include #define MAXSIZE 100int total = 0;void chessBoard(int, int, int, int, int);int board[MAXSIZE][MAXSIZE];int power(int);int main(void){ int i
2012-03-30 13:55:48
674
2
原创 归并排序
#include #include #include #include #define MAXSIZE 100#define ARRAYSIZE 8void mergeSort(int*, int);void _mergeSort(int*, int, int);//合并void merge(int*, int, int, int);//复制void c
2012-03-30 09:58:41
270
原创 二分查找
#include #include int binarySearch(int*, int, int, int*, int*);int main(void){ int left; int right; int array[] = {1, 5, 10, 12, 100, 666, 667, 800, 900, 1000}; printf("%d\
2012-03-29 13:53:19
266
原创 汉诺塔问题
#include #include void hanoi(int, char, char, char);void move(int, char, char);int main(void){ hanoi(3, 'A', 'B', 'C'); return 0;}//将n个塔座从a搬到c,b为辅助void hanoi(int n, char a, c
2012-03-29 13:42:59
2280
原创 最长公共子序列
#include #include #include #define MAXSIZE 100//最长公共子序列int LCS(const char *a, const char *b, char *result);int main(void){ char *a = "ABCBDAB"; char *b = "BDCABA"; char re
2012-03-28 12:53:49
275
原创 递归和非递归实现数组求和
#include #include #define MAXSIZE 100//定义结构体typedef struct Array{ int data[100]; int length;}Array;//非递归实现int sum (Array);//递归实现int sumRecursive (int[], int);int main(v
2012-03-25 23:21:49
796
原创 自己写strcpy
char* strcpy(char *strDest, const char *strSrc){ char *address = strDest; assert((strDest != NULL) && (strSrc != NULL)); while (*strSrc) { *strDest++ = *strSrc++; } *strDest = '\0';
2012-03-25 01:00:03
405
原创 自己写strcat
#include #include #include char* strcat(char*, const char*);int main(void){ char src[] = "i love you an ting"; char dest[] = "need you now"; strcat(dest, src); printf("%s
2012-03-25 00:55:24
527
原创 自己写strstr
int strstr(char str[], char par[]){ assert((str != NULL) && (par != NULL)); int i = 0; int j = 0; while (str[i] && par[j]) { if (str[i] == par[j])//如果相等 { ++i; ++j; }
2012-03-25 00:37:29
585
原创 递归实现链表的正序和倒序输出
void display(Link p)//正序{ if(p==NULL) { return; } printf("%d\n", p->data); display(p->next);}void displayReverse(Link p)//倒序{ if(p==NULL) {
2012-03-10 00:12:25
2779
原创 多项式相加
/* 说明：共有三个文件main.c,Polynomial.h,Polynomial.c 实例输入： 4 7 0 3 1 9 8 5 17 3 8 1 22 7 -9 8*///main.c#include #include #include "Polynomial.
2012-03-03 22:38:47
405
原创 双向链表
//main.c#include #include #include "DoublyLinkedList.h"int main(void){ int choice; DLL dll; Init(&dll); Create(&dll); while (1) { printf("please ente
2012-03-02 21:27:54
319
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人