jiankangshiye

<br />//C写MySQL连接程序所用的数据结构struct harvis_mysql_struct { MYSQL *conn; //建立的MySql连接，全局变量 int id; //连接MySql的顺序号，从0开始，初始值为-1 unsigned int query_times; //一个MySql连接上执行的查询次数，初始值为0

<br />/*********md5.h************/#ifndef __MD5_H#define __MD5_H#ifndef PROTOTYPES#define PROTOTYPES 0#endif/* POINTER defines a generic pointer type */typedef unsigned char *POINTER;/* 无符号字符类型的指针类型 *//* UINT2 defines a two byte word */ty

<br />一、时间复杂度是O(N).#include <stdio.h>int arr[3] = {0, 0, 0};enum {a, b, c};/*hash function : f(key) = key - 'a'*/int main(){ char *s = "aabbbbcccccccccc"; int i; while(*s != '/0'){ arr[*s - 'a']++; s++; } for(i = 0; i < 3

#include /*tail recursive*/int fact_iter(int product, int count, int max_count){ if (count > max_count) return product; fact_iter(pro

#include int main(){ void qsort(int v[], int left, int right); int binary_search(int v[], int left, int right, int goal); int a[] = {1,8,7,5

http://www.leptonica.org/vs2008doc/building-image-libraries.html

<br />#include <stdio.h>#include <string.h>/* 以字符ch为界分离字符串s2为前后两部分 */char *_string_parse(char *s1, char *s2, char ch){ while(*s2 == ch) s2++; while(*s2) { if (*s2 == ch) { while (*++s2 == ch); break; } *s1++ = *s2++; } *s1