beginner students, c achieve Joseph Central (round table), the algorithm should...

常用的几种排序算法的实现源码，同时还给出了几种排序算法的比较结果，源码中的排序内容都是随机产生的-several commonly used algorithm to achieve source, but also gives several algorithm result of the comparison, the ranking source content are randomly generated

仓库管理系统-Warehouse Management System

成华寻呼南充分台用户管理系统-into the South China fully Taiwan Paging Subscriber Management System

C语言写的Hash算法，在各种平台上都编译通过，可以直接使用。-C language to write the Hash algorithms on various platforms are compiled, can be used directly.

射频rda1846芯片c源代码和设置值xlc文件

一种查找数据库中关于一个字符串的匹配的数据结构-Find a database on a string of matching data structure

从库中调用图片(10KB) 从库中调用图片(10KB)-Picture from the library call (10KB) picture from the library call (10KB)

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

数据结构 之骑士周游算法-data structure Cavaliers travel Algorithm