搜索资源列表
乘风多用户计数器
- 这是一个用ASP编制而成的网业计数器，它具有一个很大优势：能够和网业分离，实现远程 调用，又可以嵌入到需要统计在线人数的网页来实现在线人数统计功能-This is an ASP compiled from the network industry counters, it has an enormous advantage : and to divide the network, remote call, Also needs to be embedded in online statist
利用分治策略实现自然合并排序算法程序;
- 利用分治策略实现自然合并排序算法程序 方便地解决排序的问题-use the divide and conquer strategy to achieve natural merger procedures to facilitate sorting algorithm to solve the problem of sorting
快排
- 快速排序 算法的基本思想： 快速排序的基本思想是基于分治策略的。对于输入的子序列ap..ar，如果规模足够小则直接进行排序，否则分三步处理 -fast algorithm basic idea : Quick Sort The basic idea is based on the divide and conquer strategy. For input sequences ap .. ar, if the scale is small enough for dire
计caltor算器
- java 编写的计算器程序，能够连加连减，还能够乘除优先-prepared by the calculator program that can reduce even the company, but can also multiply and divide priority
mergesort11
- 二分搜索是运用分治策略的典型例子。二分搜索方法充分利用了元素间的次序关系，采用分治策略，可在最坏情况下用O(logn)的时间完成搜索任务。-two hours search is to use the divide and conquer strategy is a typical example. Two-search method full use of the elements in the order, using the divide and conquer strategy, in
math8051
- A collection of math routines including 8-bit, 16-bit, 32-bit signed and unsigned addition, subtraction, multiplication, and division. Very nice code library with heavy in-line documentation! Been looking for multi-byte divide? Here it is. -A colle
DIVIDE
- 本上载源码用8031汇编语言编写实现三字节二进制无符号数除以单字节二进制数的程序-source available on the 8031 assembly language used to achieve the preparation of three-byte binary symbols divided by the number of single-byte binary number of procedures
k-divide
- 用分治算法求200个数中第K小的数。这个是学习算法课程时做的一个小作业。程序很小，不过，很好的体现了分治算法的思想。-partition algorithm used for the first 200 Number of several small K. This is a learning algorithm courses do a small operation. Procedures small, but a good indication of the partition algor
chanshenshuijishu
- 本程序需在DOS下运行。每运行一次可执行程序random.exe，即可显示任意两个 16进制数的加法或减法表达式及其运算结果。在减法运算中，如果被减数小于减数，显示 “Divide Overflow”的提示信息。-the process required under the DOS operating. Every time running executable random.exe. two shows can be arbitrary number of 16 Decimal Ad
bignumer
- 本程序定义了长度为41的数组来存放大数，进行对大数的运算。四则运算的算法就跟平时我们笔算四则运算的方法基本上一样，加减法的时间复杂度为n，乘除法的时间复杂度为n的平方。对四十位内的计算几乎都可以瞬时完成。-definition of the procedures for the length of the 41 arrays to store large numbers, the majority of arithmetic. Four computing algorithm just as w
chesscover
- 此程序是关于算法设计与分析中的棋盘覆盖问题，采用分治策略实现的。-on algorithm design and analysis covering the chessboard, using the divide and conquer strategy to achieve.
ClosestNodePairs
- 这是最接近点对问题，分别使用了分治算法和穷举法求解最接近点对。-it is the closest point of the problem, namely the use of a divide-and-conquer method and exhaustive closest point right.
kdv
- 一类kdv方程数值解法,kdv方程的数值解法，利用将偏微分方程差分化求解-a category kdv Numerical Solution of equation, kdv Numerical Solution of equation, using partial differential equations to solve poor divide
Membrane
- NVIDIA Membrane(隔膜、薄膜特效）源代码 需要硬件支持DirectX8以上的显卡。-NVIDIA Membrane (divide Films effects) source code needs more hardware support DirectX8 cards.
huibian_random
- 本程序需在DOS下运行。每运行一次可执行程序random.exe，即可显示任意两个 16进制数的加法或减法表达式及其运算结果。在减法运算中，如果被减数小于减数，显示 “Divide Overflow”的提示信息。-the process required under the DOS operating. Every time running executable random.exe. two shows can be arbitrary number of 16 Decimal Add
yueguang
- 分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（quick sort）。在这种方法中， n 个元素被分成三段（组）：左段l e f t，右段r i g h t和中段m i d d l e。中段仅包含一个元素。左段中各元素都小于等于中段元素，右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以独立排序，并且不必对l e f t和r i g h t的排序结果进行合并。m i d d l e中的元素被称为支点( p i v o t )。图1 4
yakun
- 归并排序,算法分析与设计第二章分治法思想的归并排序算法实现,用C++写的.-merge sorting algorithm analysis and design of the second chapter ideological divide-and-conquer method of merging ranking algorithm, C writes.
kuaisu
- 快速排序,算法分析与设计第二章分治法思想的快速排序算法实现.-quick sort, algorithm analysis and design of the second chapter ideological divide-and-conquer method of quick sort algorithm.
Bigintmutiply
- 大整数乘法的分治法源码，在JDK1.51中运行-large integer multiplication of the divide-and-conquer method source code, to run in JDK1.51
MergeSort2
- 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n), 需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm