ssks

线性表的建立与基本运算1.采用表尾挂入法建立一个以la为头的单链表2.采用表首插入法建立一个yilb为头指针的单链表3.就地逆转以lb为头指针的单链表。 还有矩阵的链式存贮及运算。以一个c函数创建任一稀疏矩阵的十字链表。以一个c函数从十字链表的头指针起按行序及三元组形式输出十字链表中各节点的值

可用于抽奖等需要临时随机抽号的场合（压缩包中详细的说明文档）(Can be used to draw random numbers that require temporary occasions (compressed package detailed documentation))

一个简单的四则运算考核小程序,采用VB开发。(A simple arithmetic evaluation applet development using VB.)

说明：  本程序是模拟常数PI的计算，可以精确到小数点后很多位！(This procedure is a simulation of constant PI calculation can be accurate to a lot of places after the decimal point!)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

该程序能够实现计算器程序设计，采用C++编程，来自C++程序设计原理与实践。(The program can achieve calculator program design, using C++ programming, program design from C++ Principles and Practice)

一些简单的小例子，书上的例题代码，简单易懂，谢谢(Some simple examples, the book s example code, easy to understand, thank you)

利用FT245BM USB模块做的虚拟示波器，暂时可以达到1M的速率！(FT245BM USB modules make use of a virtual oscilloscope, the time being can achieve a rate of 1M!)

对于VC编程很有帮助,非常好的操纵Win32中的线程,不错的(For VC programming very helpful, very good control of the Win32 threads, pretty good)

局域网聊天系统服务端，局域网聊天系统服务端，局域网聊天系统服务端(LAN server chat system, local area network server chat system, local area network server chat system)