algorithm
A detailed sequence of actions to perform to accomplish some task. Named after an Iranian mathematician, Al-Khawarizmi. 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://www.nist.gov/dads/)}. (2002-02-05) In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ af ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ aw ] [ B ] [ b ] [ be ] [ br ] [ ca ] [ cc ] [ ch ] [ ci ] [ ck ] [ cl ] [ co ] [ com ] [ D ] [ de ] [ du ] [ E ] [ ec ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ ge ] [ gen ] [ gh ] [ gov ] [ gr ] [ h ] [ hat ] [ hm ] [ hn ] [ hr ] [ ht ] [ hu ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ K ] [ la ] [ Lex ] [ li ] [ ls ] [ lt ] [ ly ] [ ma ] [ method ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ no ] [ ns ] [ nu ] [ om ] [ pe ] [ perf ] [ ph ] [ pl ] [ pr ] [ program ] [ programming ] [ query ] [ rc ] [ re ] [ ro ] [ ru ] [ S ] [ se ] [ sh ] [ sk ] [ so ] [ st ] [ su ] [ T ] [ th ] [ to ] [ tp ] [ tr ] [ tt ] [ ug ] [ um ] [ us ] [ va ] [ zm ] [ brute force ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (6028 Reads) |
