资源列表
排序选择:
srAQcnMc
- C#资源管理器是用treeview做的ikjoij据了解-hghgdf
twobulle
- 通常的冒泡是单向的,而这里是双向的,也就是说还要进行反向的工作。 代码看起来复杂,仔细理一下就明白了,是一个来回震荡的方式。 写这段代码的作者认为这样可以在冒泡的基础上减少一些交换(我不这么认为,也许我错了)。 反正我认为这是一段有趣的代码,值得一看。-The bubble is usually a one-way, and here is a two-way, that is to say the job would also like to reverse. The complexity o
sir
- 这是SIR微分方程模型对初值问题的求解和作图-This is the SIR model differential equations to solve the problem of initial value and mapping
drawer
- delphi 2d simple drawer
RUP
- Rup -* Rational Metodology-Rup-* Rational Metodology
shell
- 首先需要一个递减的步长,这里我们使用的是9、5、3、1(最后的步长必须是1)。 工作原理是首先对相隔9-1个元素的所有内容排序,然后再使用同样的方法对相隔5-1个元素的排序,以次类推。 -First step reduced the need for a long, here is our use of 9,5,3,1 (the final step must be to 1). The first is that on the job between 9-1 months to sort
fast
- 首先我们选择一个中间值middle程序中我们使用数组中间值,然后 把比它小的放在左边,大的放在右边(具体的实现是从两边找,找到一对后交换)。然后对两边分别使 用这个过程(最容易的方法——递归)。 -First of all, we choose a middle value between the use of an array of programs between our values, then it is smaller than put on the left, large on th
arbol_genealogico.2463
- Genalogic tree made in c-Genalogic tree made in c++
EditText
- 用java.swing写的一个记事本程序,初学者可以-Writing with a java.swing Notepad program, beginners can take a look at
paintbrush
- paintbrush in borland c++ builder
search
- 以网站自动提交搜索的方式实现的一个简单的搜索引擎实例。-Automatically submitted to search the web the way the implementation of a simple example of search engines.
exchang
- 交换法: 交换法的程序最清晰简单,每次用当前的元素一一的同其后的元素比较并交换-Exchange: the exchange of law, the most clear and straightforward procedures, each with 11 elements of the current element of the comparison with the subsequent exchange