the firts use vb,simple

【程序70】 题目：写一个函数，求一个字符串的长度，在main函数中输入字符串，并输出其长度。　　　 1.程序分析： 2.程序源代码：-[70] procedures Topic: Writing a function, and the length of a string, in the main function in the input string and output its length. 1. Program analysis: 2. Program source code:

实例08-TUSPY-08-TUSPY

给定一个矩形，把这个矩形拆分成若干个正方形，这些正方形的边长相同，问怎样拆分，正方形的边长是最大的，并把这个边长输出来。-given a rectangular, the rectangular split into a number of square, the square-the same side, asking how separation of the square is the largest side length, and the side length output.

成绩管理程序,C语言开发,有一定实用价值!-performance management procedures, C-language development, which is of practical value!

气球样的工具提示-balloon kind of a tool tip

这是有关小波的程序,希望大家能够从中得到收获-This is the wavelet procedures, we hope to reap harvest

这是我的WINDOWS技术课程设计，在VC++下开发的。作者：郭尚波 内蒙古农业大学计算机与信息工程学院 2001级计算机科学与技术2班-This is my WINDOWS technology curriculum design, the development of the VC. Author : Guochangbei Inner Mongolia Agricultural University of Computer and Information Engineering College 2001 Computer Science and Technology 2 classes

microsoft cryptoapi CSP模块的一个示例。

可以检查一篇文章，统计单词数字并且不用理会分隔符-through a artical, you can use this to account the number of words regardless the part simpols.

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.