英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

algorithm    音标拼音: ['ælgɚ,ɪðəm]
n. 运算法则

运演算法则

algorithm
演算法


algorithm
演算法; 处理步骤


algorithm
算法 ALG

algorithm
演算法 处理步骤 算法

algorithm
n 1: a precise rule (or set of rules) specifying how to solve
some problem [synonym: {algorithm}, {algorithmic rule},
{algorithmic program}]

Algorism \Al"go*rism\, Algorithm \Al"go*rithm\, n. [OE.
algorism, algrim, augrim, OF. algorisme, F. algorithme (cf.
Sp. algoritmo, OSp. alguarismo, LL. algorismus), fr. the Ar.
al-Khow[=a]rezm[imac] of Khow[=a]rezm, the modern Khiwa,
surname of Abu Ja'far Mohammed ben Mus[=a], author of a work
on arithmetic early in the 9th century, which was translated
into Latin, such books bearing the name algorismus. The
spelling with th is due to a supposed connection with Gr. ?
number.]
1. The art of calculating by nine figures and zero;
computation with Arabic figures.
[1913 Webster]

2. the Arabic system of numeration.

Syn: decimal system
[WordNet 1.5]

3. The art of calculating with any species of notation; as,
the algorithms of fractions, proportions, surds, etc.
[1913 Webster]


algorithm \algorithm\ n.
a precise rule (or set of rules) specifying how to solve some
problem; a set of procedures guaranteed to find the solution
to a problem.

Syn: algorithmic rule, algorithmic program
[WordNet 1.5 PJC]

51 Moby Thesaurus words for "algorithm":
Arabic numerals, MO, Roman numerals, algorism, applied mathematics,
approach, attack, binary system, course, decimal system,
duodecimal system, fashion, figures, form, guise,
hexadecimal system, higher mathematics, line, line of action,
lines, manner, manner of working, math, mathematic, mathematics,
means, method, methodology, mode, mode of operation,
mode of procedure, modus operandi, numbers, octal system, order,
practice, procedure, proceeding, process, pure mathematics,
routine, style, system, tack, technique, the drill, the how,
the way of, tone, way, wise

A detailed sequence of actions to
perform to accomplish some task. Named after the Iranian,
Islamic mathematician, astronomer, astrologer and geographer,
{Muhammad ibn Musa al-Khwarizmi}.

Technically, an algorithm must reach a result after a {finite}
number of steps, thus ruling out {brute force} search methods
for certain problems, though some might claim that brute force
search was also a valid (generic) algorithm. The term is also
used loosely for any sequence of actions (which may or may not
terminate).

{Paul E. Black's Dictionary of Algorithms, Data Structures,
and Problems (http://nist.gov/dads/)}.

(2002-02-05)

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • How does a diff algorithm work, e. g. in VCDIFF and DiffMerge?
    An O(ND) Difference Algorithm and its Variations (1986, Eugene W Myers) is a fantastic paper and you may want to start there It includes pseudo-code and a nice visualization of the graph traversals involved in doing the diff Section 4 of the paper introduces some refinements to the algorithm that make it very effective
  • algorithm - Calculate distance between two latitude-longitude points . . .
    Some of the answers do refer to Vincenty's formula for ellipsoids, but that algorithm was designed for use on 1960s' era desk calculators and it has stability accuracy issues; we have better hardware and software now Please see GeographicLib for a high quality library with implementations in various languages –
  • What are some algorithms for comparing how similar two strings are?
    You may use the algorithm of computing the length of the longest common sub-sequence to solve the problem If the length of the longest common sub-sequence for both the input strings is less than the length of either of the strings, they are unequal
  • algorithm - When should I use Kruskal as opposed to Prim (and vice . . .
    Kruskal's algorithm will grow a solution from the cheapest edge by adding the next cheapest edge, provided that it doesn't create a cycle Prim's algorithm will grow a solution from a random vertex by adding the next cheapest vertex, the vertex that is not currently in the solution but connected to it by the cheapest edge
  • algorithm - What is the most efficient way of finding a path through a . . .
    The most commonly used algorithm for this problem is A* (A Star), which is a generalized Dijkstra's algorithm search with added heuristics - the purpose of the heuristics is to direct the search towards the search goal so that typical searches finish faster
  • algorithm - How to generate Sudoku boards with unique solutions - Stack . . .
    Unless P = NP, there is no polynomial-time algorithm for generating general Sudoku problems with exactly one solution In his master's thesis, Takayuki Yato defined The Another Solution Problem (ASP), where the goal is, given a problem and some solution, to find a different solution to that problem or to show that none exists
  • algorithm - How to find convex hull in a 3 dimensional space - Stack . . .
    Since the algorithm spends O(n) time for each convex hull vertex, the worst-case running time is O(n2) However, if the convex hull has very few vertices, Jarvis's march is extremely fast A better way to write the running time is O(nh), where h is the number of convex hull vertices
  • algorithm - Finding all possible combinations of numbers to reach a . . .
    Here is a Java version which is well suited for small N and very large target sum, when complexity O(t*N) (the dynamic solution) is greater than the exponential algorithm My version uses a meet in the middle attack, along with a little bit shifting in order to reduce the complexity from the classic naive O(n*2^n) to O(2^(n 2))
  • algorithm - how to convert decimal value to binary bits . . . - Stack . . .
    An algorithm that will, given an integer N, produce a string of characters S representing N in binary notation do { if N is odd { add '1' to the beginning of S } else { add '0' to the beginning of S } divide N by 2 } while N is non-zero Using the requested example:
  • algorithm - Fastest way to determine if all the elements of an array . . .
    My idea is to look for elements equal to the chosen pivot on each step In this way, whenever there are more than two elements, we will compare the pivot to each element If we have found a duplicate, we have the answer Otherwise we split the problem in two similar ones, but with smaller size and run the algorithm on them





中文字典-英文字典  2005-2009