-
实现了比如一个字符数组14232156的整形数组。经过此算法后转换成12345612的排列顺序。此代码对棋牌类游戏中的出对子有帮组...
实现了比如一个字符数组14232156的整形数组。经过此算法后转换成12345612的排列顺序。此代码对棋牌类游戏中的出对子有帮组-Realize the array of characters such as a plastic array 14232156. After this algorithm into a sequence of 12345612. This code of Card games in the pair has helped the group
- 2022-02-20 21:03:22下载
- 积分：1
-
SMTP(发送E
SMTP(发送E-mail),供大家参考，希望大家喜欢-SMTP (Send E-mail), for your information, I hope everyone likes
- 2023-05-19 20:15:03下载
- 积分：1
-
this file is about communication engineering
Digital Transmission System...
this file is about communication engineering
Digital Transmission System
this is a .m file to simulate a signal and noise ratio which the signal is NRZ bipolar signal and the noise is gaussian noise
it will plot the error probability
- 2022-02-15 17:09:31下载
- 积分：1
-
a dialog box under the demonstration program, EVC development, using coordinates...
一个WIN CE4.2下的对话框演示程序，用EVC开发，用坐标确定按键位置-a dialog box under the demonstration program, EVC development, using coordinates to determine location of the keys
- 2022-03-18 17:34:57下载
- 积分：1
-
PERL编程24小时的教程。rar
PERL编程24学时教程.rar-PERL programming 24 hours tutorial. Rar
- 2022-01-27 20:55:58下载
- 积分：1
-
NetAnts similar drag
类似网络蚂蚁的拖放窗口，VC＋＋源代码，希望大家能用得上。-NetAnts similar drag-and-drop window, VC source code, hope that we can useful.
- 2022-07-21 08:43:55下载
- 积分：1
-
孙鑫的vc++6.0的讲解的源码部分，免费给大家分享
孙鑫的vc++6.0的讲解的源码部分，免费给大家分享-SUN Xin of vc++6.0 on the part of the source, free for everyone to share
- 2022-02-27 00:31:30下载
- 积分：1
-
奇东锐腾KDBits及KDMount配套工具
奇东锐腾KDBits及KDMount配套工具-Qi Rui Teng KDBits East and supporting tools KDMount
- 2022-12-21 07:05:03下载
- 积分：1
-
视频调试EVC 应用DDRAW 480*240大小
视频调试EVC 应用DDRAW 480*240大小-EVC debug video applications DDRAW 480* 240 size
- 2022-01-21 22:28:49下载
- 积分：1
-
1背包问题是NP难题。0
0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right
- 2022-03-25 00:00:51下载
- 积分：1
