- DS_HW 这是数据结构课的12次作业
- VB_programming_language_method_add_code_image VB编程实现 图片上加文字方法代码VB programming language method add code image
- CC1100 cc1100芯片特点
- Dissertation-priliminary This file contains basic hardware implementation of DWT based watermarking system. It also gives hardware efficient procedure for lifting based wavelet scheme.
- dct-quanlity-snr 对一幅图像进行不同量化水平的DCT变换
- taokeshu1.2 淘客鼠淘宝客站群管理系统1.2更新日志 1.对产品图片URL地址进行代码优化
资源列表
FlowFieldaroundCar
- 轿车外流场数值模拟的研究，应用ansys fluent和gambit相关知识，对阶背式和快背式轿车轿车车身外流场进行数值模拟；进行计算模型的建立，数值计算和结果分析；希望对您有用。 作者：Q 651552016 www.1-fun.com-Numerical Simulation of Flow Field around Car
chengxuyuandaima
- 遗传算法中初始化种群一些重要的源码，应该会有帮助的，希望能上传啊-Initial population genetic algorithm important source should be helpful, I hope to be able to upload ah
jisuanqi
- 只要实现科学计算器的功能，用栈写的-Scientific calculator function stack write! ! ! ! ! ! ! ! !
KMP
- KMP算法，对学习数据结构的同学有一些帮助-KMP algorithm, students learning data structures
divid
- divid算法，可用于分治法，对于数据结构的学习较有帮助-divid algorithm can be used to divide and conquer
hxsfPzdpp
- 核心算法和最大匹配，对于数据结构的学习较有帮助-Core algorithm and the maximum matching, for the data structure of the study more
Horner
- 基于Horner规则的多项式求解，主要思想递归-Horner Rule iter
FB_StrValueAdd
- 实现多个字符串数值相加求和，生成一个新的字符串。可以实现带时标和不带时标字符串两种格式。-Implement multiple string values summed to generate a new string. With the time scale can be achieved without a time scale string two formats.
Desktop
- 主要为数据结构的一些基本的程序 如约瑟夫环，二叉树遍历-Mainly some basic procedures for data structures such as Josephus, binary tree traversal, etc.
topxia-TopxiaOEmbed-4cb4183
- PHP解析优酷、土豆、酷6、新浪视频等网址 参见 Demo，见好知网的小组“发视频"的功能。-The PHP parsing Youku, potatoes, cool, Sina video website see http://www.howzhi.com/group/php/discuss/424 Demo, brought the matter the HowNet of team " made the video" functionality.
AlgorithmsandDataStructures.pdf
- 算法与数据结构 第1章 引论 数据结构研究什么 基本概念和术语 数据类型和抽象数据类型 算法和算法分析 用C语言描述数据结构与算法-Algorithms and Data Structures
Graph-traversal
- 图的遍历及实验报告。输入构建一个无向图，将其用深度优先搜索的递归和非递归遍历以及广度优先搜索遍历，并输出。-Graph traversal and experimental reports. Input to build a non-directed graph, its recursive and non-recursive traversal depth-first search, and breadth-first search traversal, and output.