-
interface development library, a free good, we can learn from
界面开发类库,免费的很好,可以学习-interface development library, a free good, we can learn from
- 2022-05-10 22:29:33下载
- 积分:1
-
二次牛顿插值 对flexgrid 单元格可编辑
二次牛顿插值 对flexgrid 单元格可编辑-right flexgrid cells can edit
- 2022-01-25 17:45:02下载
- 积分:1
-
[soldiers] fighting roars dedicated suggest dedicated plug
[战士]战斗怒吼专用提示插件
WOW专用-[soldiers] fighting roars dedicated suggest dedicated plug-WOW
- 2022-04-09 05:09:18下载
- 积分:1
-
qt code has been compiled using mingw, qt a good school learning materials
qt 代码,已经用mingw编译好,不错的学qt学习资料-qt code has been compiled using mingw, qt a good school learning materials
- 2022-03-20 18:49:54下载
- 积分:1
-
一个 XP 界面类库(更新)
一个 XP 界面类库(更新)-an XP interface class library (update)
- 2023-08-27 18:05:03下载
- 积分:1
-
Title: [ Menu Maker ] Description: Menu Maker by arrow keys.... This file came f...
Title: [ Menu Maker ] Description: Menu Maker by arrow keys.... This file came from Planet-Source-Code.com...the home millions of lines of source code
- 2022-03-06 21:39:36下载
- 积分:1
-
在LabVIEW 1d_array_gaussian滤波器
应用背景利用LabVIEW文件 ;可以过滤生物医学图像的PSNR值面糊然后所有的过滤器。现在生物医学仪器研究领域的一个重要研究领域是一个非常重要的角色。关键技术这是一个基于Labview的图像处理。VI文件。 ; ;我们可以用这个生物医学图像处理。
- 2022-02-03 18:13:08下载
- 积分:1
-
本例实现了一个写字板应用程序,主要介绍多文档模板的程序框架,启动屏,快捷工具栏,状态栏的相关知识。...
本例实现了一个写字板应用程序,主要介绍多文档模板的程序框架,启动屏,快捷工具栏,状态栏的相关知识。-the cases achieved a tablet applications, introduced Multi-document template framework of the procedure, starting screen, fast toolbar, status bar of relevant knowledge.
- 2022-07-20 21:42:43下载
- 积分:1
-
A very good voice program
一个 很好的 语音程序的源代码
VC++编译通过,-A very good voice program
- 2022-08-04 08:32:01下载
- 积分:1
-
选择排序是一种比较优化的排序,它定义的k意义在于表示一次循环后找到的最小(大)值的位置,然后让第i个(第几次循环就是第几个)植交换,这样在第一轮循环中就把最小(...
选择排序是一种比较优化的排序,它定义的k意义在于表示一次循环后找到的最小(大)值的位置,然后让第i个(第几次循环就是第几个)植交换,这样在第一轮循环中就把最小(大)的值换到了最前面,如果只用i,j 的话,就没有办法找出待排序数据中的最值了
比较排序也叫冒泡排序,就是把相邻的数据比较交换,因为其把小的数字从后面往前慢慢移动,感觉象水泡上升一样,所以叫冒泡排序法.
如过你还没理解,留言~-SELECTION SORT is a more optimal sequencing, its definition of k significance lies in a circle said they find the smallest (large) value of the location, i then allow the first (the first cycle was the first several several) plant exchange, this cycle in the first round put the smallest (CUHK) for the value of the front, if only i, j, then there is no way to identify sequencing data to be the most value compared sequencing is also called Bubble Sort. adjacent is to the comparison of data exchange, because of their small numbers from the back slowly moving forward, Soak up feeling like the same, so called Bubble Sort law. No off if you understand that message ~
- 2022-12-28 03:55:04下载
- 积分:1