搜索资源列表
Divide-and-Conquer-maxmin
- 分治策略 maxmin算法 求数组A[1...n]最大最小元素-Divide and Conquer maxmin
divide-into-python
- 这是一本详细介绍python及其应用的书籍，内容理论同时结合实际的例子，是关于 python的很经典的一本书籍-the book is about python,and it is therotical and practical.it is a very classical book anout python
Divide-and-conquer-algorithm
- 分治算法是基于多分枝递归的一种算法设计模式。分治算法递归地把一个大问题分解为多个类型相同的子问题，直到这些子问题足够的简单能被直接解决。最后把这些子问题的解结合起来就能得到原始问题的解。-Divide and conquer algorithm is based on a multi-branch recursive algorithm design pattern. Divide and conquer algorithm recursively to a large problem into
divide
- divide模块，实现除法功能。该module是用Verilog编写的，压缩包里包括了设计程序以及测试程序（testbench）。-divide module, the division function. The module is written in Verilog, compression bag, including the design process and testing process Sequence (testbench).
divide-cells-excel
- divide text in the ce-divide text in the cell
Divide-et-impera
- divide et impera method of programming in some exercises
Divide
- 分治法求最值的C++程序实现。算法设计课程可以参考-Divide and conquer method to seek the most value C++ program.
Divide-by-2-Counter
- 2分频，通过计数器实现，很实用的，可以作为时钟驱动。-Divide by the counter to achieve very practical, can be used as clock driver.
Divide
- this is code divide algorithm
recursive-divide-and-conquer
- 算法设计课件(第二章递归与分治)，主要讲述递归与分治-Algorithm courseware design (Chapter II recursive divide and conquer), focuses on the recursive divide and conquer
random-divide-group
- 随即分组的一种简单算法，类似于分组摇号抽奖的功能实现-random divide group
divide
- 实现带符号位的除法，使用二进制的左移处理，属于第三个大作业，懂的人都懂得-signed divide
Character-digital-divide
- 字符数字分割Character digital divide-Character digital divide
Divide-MergeSort
- 分治法描述归并/合并排序，附有文档详细说明。-The divide-and-conquer method described merge/merge sort, with document details.
Divide-and-ConqueraaMST
- 分治，最小生成树。自己做题的心得以及代码，希望可以对初学者起到一点作用。-Divide and conquer, minimum spanning tree
conquer-and-divide-algorithm
- 本章描述了讲解了分治算法的基本思想和设计过程以及原理-Explain the basic idea and design process as well as the principle of divide and conquer algorithm described in this chapter
divide-and-conquer-algorithm
- 利用分治策略求解时，所需时间取决于分解后子问题的个数、子问题的规模大小等因素，而二分法，由于其划分的简单和均匀的特点，是经常采用的一种有效的方法，例如二分法检索。-When solving using the divide and conquer strategy, the time required depends on the number of decomposed sub-problems, the size of sub-problems and other factors, but
divide-and-conquer
- 组合优化与算法分析 分治算法（divide and conquer）的描述和分析-divide and conquer
C-program-to-add--subtract--multiply-and-divide-C
- C program to add, subtract, multiply and divide Complex Numbers, complex arithmetic
divide-and-conquer-algorithm
- 《算法引论中》解决分治算法问题以及轮廓问题，讨论算法，适合初学者-" Introduction to Algorithms in the" divide and conquer algorithm to solve the problem and outline problems, discuss algorithms, suitable for beginners