25,161
edits
Changes
Created page with "'''Home * Programming * Algorithms''' thumb|right|[[Mathematician#Algoritmi|Muḥammad ibn Mūsā al-Khwārizmī <ref>A stamp..."
'''[[Main Page|Home]] * [[Programming]] * Algorithms'''
[[File:1983_CPA_5426_(1).png|thumb|right|[[Mathematician#Algoritmi|Muḥammad ibn Mūsā al-Khwārizmī]] <ref>A stamp issued September 6, 1983 in the [https://en.wikipedia.org/wiki/Soviet_Union Soviet Union]], commemorating [[Mathematician#Algoritmi|Al-Khwārizmī's]] (approximate) 1200th birthday</ref> ]]
'''Algorithms''',
in mathematics and computer science, methods for solving a problem expressed as a finite sequence of instructions. The term “algorithm” is derived from the name of [[Mathematician#Algoritmi|Muḥammad ibn Mūsā al-Khwārizmī]] (born approximately 780 in [https://en.wikipedia.org/wiki/Khwarezm Khwarezm], died between 835 and 850), the [https://en.wikipedia.org/wiki/Persian_people Persian] [https://en.wikipedia.org/wiki/Mathematics_in_medieval_Islam mathematician], [https://en.wikipedia.org/wiki/Astronomy_in_medieval_Islam astronomer], [https://en.wikipedia.org/wiki/Geography_and_cartography_in_medieval_Islam geographer], and scholar in the [https://en.wikipedia.org/wiki/House_of_Wisdom House of Wisdom] in [https://en.wikipedia.org/wiki/Baghdad Baghdad], from the [https://en.wikipedia.org/wiki/Khorasan_Province Khorasan province] of present-day [https://en.wikipedia.org/wiki/Uzbekistan Uzbekistan] <ref> [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/%7Emehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [http://www.mpi-inf.mpg.de/%7Emehlhorn/ftp/Toolbox/Appetizer.pdf Appetizer: Integer Arithmetics] (pdf)</ref> .
=General Concepts=
* [[General Setwise Operations]]
* [[Iteration]]
* [[Pseudorandom Number Generator]]
* [[Recursion]]
=Sorting and Searching=
* [[ABDADA]]
* [[All Shortest Paths|All shortest Paths]]
* [[Alpha-Beta]]
* [[B*]]
* [[Best-First]]
* [[Brute-Force]]
* [[Depth-First]]
* [[King Pattern#FloodFillAlgorithms|Flood Fill Algorithm]]
* [[Iterative Search]]
* [[Jamboree]]
* [[Monte-Carlo Tree Search]]
* [[Move Ordering]]
* [[MTD(f)]]
* [[NegaC*]]
* [[NegaScout]]
* [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta]] in [[Cilk]]
* [[Parallel Search]]
* [[Principal Variation Search]]
* [[Proof-Number Search]]
* [[Retrograde Analysis]]
* [[Search]]
* [[SEE - The Swap Algorithm]]
* [[SEX Algorithm]]
* [[SOMA#SOMAALGO|SOMA Algorithm]]
* [[SSS* and Dual*]]
* [[UCT]]
* [[Young Brothers Wait Concept]]
=Enumeration and Backtracking=
* [[Backtracking]]
* [[De Bruijn Sequence Generator]]
* [[Traversing Subsets of a Set]]
* [[Trial and Error]]
=Mathematical Optimization=
* [[CLOP]]
* [[Dynamic Programming]]
* [[Genetic Programming#EvolutionaryAlgorithms|Evolutionary Algorithms]]
* [[Hill Climbing]]
* [[Simulated Annealing]]
* [[SPSA]]
=Combinatorial=
* [[Bit-Twiddling]]
* [[BitScan]]
* [[Flipping Mirroring and Rotating]]
* [[Kogge-Stone Algorithm]]
* [[Parallel Prefix Algorithms]]
* [[Population Count]]
=See also=
* [[BCH Hashing]]
* [[Data]]
* [[Fill Algorithms]]
* [[Hash Table]]
* [[Learning]]
* [[Mathematician]]
* [[SIMD and SWAR Techniques]]
* [[Space-Time Tradeoff]]
* [[Zobrist Hashing]]
=Publications=
==1960 ...==
* [[Donald Knuth|Donald E. Knuth]] ('''1968 ...'''). ''[http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html The Art of Computer Programming (TAOCP)]'' <ref>[https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming The Art of Computer Programming from Wikipedia]</ref>
: Volume 1 - Fundamental Algorithms ('''1968''')
: Volume 2 - Seminumerical Algorithms ('''1969''')
: Volume 3 - Sorting and Searching ('''1973''')
: Volume 4 - Combinatorial Algorithms in preparation (five fascicles have been published as of April 2009)
: Volume 4A - Enumeration and Backtracking
: Volume 4B - Graph and Network Algorithms
: Volume 4C and possibly 4D - Optimization and Recursion
: Volume 5 - Syntactic Algorithms, planned (as of August 2006, estimated in 2015).
==1970 ...==
* [https://en.wikipedia.org/wiki/Niklaus_Wirth Niklaus Wirth] ('''1976'''). ''[https://en.wikipedia.org/wiki/Algorithms_%2B_Data_Structures_%3D_Programs Algorithms + Data Structures = Programs]''.
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1979'''). ''Algorithms of adaptive search''. [http://www.doc.ic.ac.uk/%7Eshm/MI/mi9.html Machine Intelligence 9] (eds. [[Jean Hayes Michie]], [[Donald Michie]] and L.I. Mikulich), pp. 373-384. Ellis Horwood, Chichester
==1980 ...==
* [[Mathematician#Ershov|Andrei P. Ershov]], [[Donald Knuth]] (Eds.) ('''1981'''). ''Algorithms in Modern Mathematics and Computer Science''. Proceedings, [https://en.wikipedia.org/wiki/Urgench Urgench], Uzbek SSR, September 16-22, 1979. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 122, Springer » [[Donald Knuth#ErshovArchive|Ershov Archive]]
* [[Michel Gondran]], [Mathematician#MMinoux|Michel Minoux]], [https://en.wikipedia.org/wiki/Steven_Vajda Steven Vajda] ('''1984'''). ''[http://portal.acm.org/citation.cfm?id=817 Graphs and Algorithms]''. [https://en.wikipedia.org/wiki/John_Wiley_%26_Sons John Wiley & Sons], [http://books.google.com/books?id=2uhQAAAAMAAJ google], [http://www.amazon.com/Graphs-Algorithms-Discreet-Mathematics-1-484/dp/0471103748 amazon]
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''Algorithms for Games''. Springer, [http://www.amazon.com/Algorithms-Games-Georgy-M-Adelson-Velsky/dp/0387966293 amazon.com]
==1990 ...==
* [[John Tromp]] ('''1993'''). ''[http://homepages.cwi.nl/~tromp/thesis.html Aspects of Algorithms and Complexity]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], advisor [[Mathematician#PVitany|Paul Vitányi]]
* [[Warren D. Smith]], [[Kevin J. Lang]] ('''1994'''). ''Values of the merging function and algorithm design as a game''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [http://scorevoting.net/WarrenSmithPages/homepage/mergepap.ps ps]
* [[Leen Ammeraal]] ('''1996'''). ''[http://home.planet.nl/%7Eammeraal/algds.html Algorithms and Data Structures in C++]''. Chichester: [http://eu.wiley.com/WileyCDA/Section/id-300022.html John Wiley]
* [[Steven Skiena]] ('''1998'''). ''The Algorithm Design Manual''. 2nd Edition 2008
* [[Harald Prokop]] ('''1999'''). ''Cache-Oblivious Algorithms''. Masters thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/Prokop99.pdf pdf]
==2000 ...==
* [[Donald Knuth]] ('''2000'''). ''[http://www-cs-faculty.stanford.edu/~uno/aa.html Selected Papers on Analysis of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 102
* [[Richard C. T. Lee|R. C. T. Lee]], [http://www.arnetminer.org/viewperson.do?naid=833742&keyword=S.%20S.%20Tseng S. S. Tseng], [http://www.arnetminer.org/viewperson.do?naid=1257780&keyword=R.%20C.%20Chang R. C. Chang], [http://www.arnetminer.org/viewperson.do?naid=1419034&keyword=Yin-Te%20Tsai Y. T. Tsai] ('''2005'''). ''Introduction to the Design and Analysis of Algorithms, a Strategic Approach''. [https://en.wikipedia.org/wiki/McGraw-Hill McGraw-Hill], [http://www.amazon.com/Introduction-Design-Analysis-Algorithms-Y-T-Tsai/dp/0071243461 amazon]
* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]
* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#UVVazirani|Umesh Vazirani]] ('''2006'''). ''[http://www.cs.berkeley.edu/%7Evazirani/algorithms.html Algorithms]''. [https://en.wikipedia.org/wiki/McGraw-Hill McGraw-Hill], [http://www.amazon.com/gp/product/0073523402?ie=UTF8&tag=ebookdire-20&link_code=as3&camp=211189&creative=373489&creativeASIN=0073523402 amazon]
* [http://info.iut-bm.univ-fcomte.fr/staff/bahi/ Jacques Bahi], [http://www.loria.fr/%7Econtasss/ Sylvain Contassot-Vivier], [[Raphaël Couturier]] ('''2007'''). ''[http://www.crcpress.com/ecommerce_product/product_detail.jsf?catno=C808X&isbn=0000000000000&parent_id=&pc= Parallel Iterative Algorithms: From Sequential to Grid Computing]''. [https://en.wikipedia.org/wiki/Chapman_%26_Hall Chapman & Hall]/CRC Numerical Analysis and Scientific Computing Series
* [[David J. Stracuzzi]] ('''2007'''). ''Randomized Feature Selection''. in [http://scholar.google.com/citations?user=Dzf46C8AAAAJ Huan Liu], [http://www.ar.sanken.osaka-u.ac.jp/~motoda/motopreg.html Hiroshi Motoda] (eds.) [http://www.crcpress.com/product/isbn/9781584888789 Computational Methods of Feature Selection]. [https://en.wikipedia.org/wiki/CRC_Press CRC Press], [http://www.stracuzzi.info/david/manuscripts/cmfs07-randomized.pdf pdf]
* [[Steven Skiena]] ('''2008'''). ''[http://www.springer.com/us/book/9781848000698 The Algorithm Design Manual]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], 2nd Edition
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/%7Emehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Michel Gondran]], [[Mathematician#MMinoux|Michel Minoux]] ('''2008, 2010'''). ''[http://www.springer.com/mathematics/applications/book/978-0-387-75449-9 Graphs, dioids and semirings - New Models and Algorithms]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], from [http://books.google.com/books/about/Graphs_dioids_and_semirings.html?id=XudA1RktfCAC google], [http://www.amazon.com/Graphs-Dioids-Semirings-Algorithms-Operations/dp/1441945296/ref=ntt_at_ep_dpt_2 amazon.com], 2nd edition from [http://www.alibris.com/booksearch?qisbn=9781441945297 alibris.com] <ref>[https://en.wikipedia.org/wiki/Ordinal_optimization Ordinal optimization from Wikipedia]</ref>
* [[Mathematician#THCormen|Thomas H. Cormen]], [[Charles Leiserson|Charles E. Leiserson]], [[Ronald L. Rivest]], [[Mathematician#CliffordStein|Clifford Stein]] ('''2009'''). ''[https://en.wikipedia.org/wiki/Introduction_to_Algorithms Introduction to Algorithms, 3rd Edition]''.
==2010 ...==
* [[Donald Knuth]] ('''2010'''). ''[http://www-cs-faculty.stanford.edu/~uno/da.html Selected Papers on Design of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 191, [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
* [[Mathematician#BVoecking|Berthold Vöcking]] et al. (eds.) ('''2011'''). ''[http://www.springer.com/gp/book/9783642153273 Algorithms Unplugged]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Katja Grace]] ('''2013'''). ''Algorithmic Progress in Six Domains''. Technical report 2013-3, [https://en.wikipedia.org/wiki/Machine_Intelligence_Research_Institute Machine Intelligence Research Institute], [https://en.wikipedia.org/wiki/Berkeley,_California Berkeley, CA], [http://intelligence.org/files/AlgorithmicProgress.pdf pdf], 5 [[Games|Game Playing]], 5.1 [[Chess]], 5.2 [[Go]], 9 [[Learning|Machine Learning]]
=External Links=
* [https://en.wikipedia.org/wiki/Algorithm Algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Mu%E1%B8%A5ammad_ibn_M%C5%ABs%C4%81_al-Khw%C4%81rizm%C4%AB Muḥammad ibn Mūsā al-Khwārizmī]
* [https://en.wikipedia.org/wiki/Ban%C5%AB_M%C5%ABs%C4%81 Banū Mūsā from Wikipedia]
* [https://en.wikipedia.org/wiki/Algorithm_characterizations Algorithm characterizations from Wikipedia]
* [https://en.wikipedia.org/wiki/Analysis_of_algorithms Analysis of algorithms from Wikipedia]
* [https://en.wikipedia.org/wiki/Big_O_notation Big O notation from Wikipedia]
* [https://en.wikibooks.org/wiki/Algorithms Algorithms - Wikibooks]
* [http://xlinux.nist.gov/dads/ Dictionary of Algorithms and Data Structures] by [http://hissa.nist.gov/%7Eblack/ Paul E. Black], [https://en.wikipedia.org/wiki/National_Institute_of_Standards_and_Technology National Institute of Standards and Technology]
* [https://en.wikipedia.org/wiki/Dictionary_of_Algorithms_and_Data_Structures Dictionary of Algorithms and Data Structures from Wikipedia]
* [http://aggregate.org/MAGIC The Aggregate Magic Algorithms] by [[Hank Dietz]] » [[Bit-Twiddling]]
* [http://webhome.cs.uvic.ca/%7Evanemden/mathart/mathart.html Algorithmic Art] by [[Maarten van Emden]]
* [https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming The Art of Computer Programming from Wikipedia]
* [[Java]] [http://code.google.com/p/aima-java/ implementation of algorithms] from [[Peter Norvig|Norvig]] and [[Stuart Russell|Russell's]] ''[http://aima.cs.berkeley.edu/ Artificial Intelligence: A Modern Approach]''. 3rd edition
==Algorithms==
* [https://en.wikipedia.org/wiki/Category:Algorithms Category:Algorithms from Wikipedia]
: [https://en.wikipedia.org/wiki/Algorithms_for_calculating_variance Algorithms for calculating variance]
: [https://en.wikipedia.org/wiki/Approximation_algorithm Approximation algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms Cryptographic hash algorithms]
: [https://en.wikipedia.org/wiki/Divide_and_conquer_algorithm Divide and conquer algorithm]
* [https://en.wikipedia.org/wiki/List_of_algorithms List of algorithms from Wikipedia]
: [https://en.wikipedia.org/wiki/Deterministic_algorithm Deterministic algorithm]
: [https://en.wikipedia.org/wiki/Distributed_algorithms Distributed algorithms]
: [https://en.wikipedia.org/wiki/Nondeterministic_algorithm Nondeterministic algorithm]
: [https://en.wikipedia.org/wiki/Metaheuristic Metaheuristic]
: [https://en.wikipedia.org/wiki/Parallel_algorithm Parallel algorithm]
: [https://en.wikipedia.org/wiki/Quantum_algorithm Quantum algorithm]
* [https://en.wikipedia.org/wiki/Randomized_algorithm Randomized algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Las_Vegas_algorithm Las Vegas algorithm]
: [https://en.wikipedia.org/wiki/Monte_Carlo_algorithm Monte Carlo algorithm]
: [https://en.wikipedia.org/wiki/Pseudorandom_number_generator Pseudorandom number generator]
===[https://en.wikipedia.org/wiki/Abstract_algebra Algebra] and [https://en.wikipedia.org/wiki/Calculus Calculus]===
* [https://en.wikipedia.org/wiki/Algorism Algorism from Wikipedia]
* [https://en.wikipedia.org/wiki/Berlekamp%27s_algorithm Berlekamp's algorithm from Wikipedia] » [[Elwyn Berlekamp]]
* [https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Massey_algorithm Berlekamp–Massey algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Buchberger%27s_algorithm Buchberger's algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Cantor%E2%80%93Zassenhaus_algorithm Cantor–Zassenhaus algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Computus Computus from Wikipedia]
* [https://en.wikipedia.org/wiki/Divisibility_rule Divisibility rule from Wikipedia]
* [https://en.wikipedia.org/wiki/Division_%28digital%29 Division (digital) from Wikipedia]
* [https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Gaussian_elimination Gaussian elimination from Wikipedia]
* [https://en.wikipedia.org/wiki/Gauss%E2%80%93Newton_algorithm Gauss–Newton algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Householder%27s_method Householder's method from Wikipedia]
* [https://en.wikipedia.org/wiki/Kuwaiti_algorithm Kuwaiti algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Levenberg%E2%80%93Marquardt_algorithm Levenberg–Marquardt algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Multiplication_algorithm Multiplication algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm from Wikipedia]
: [https://www.coursera.org/learn/algorithm-design-analysis Algorithms: Design and Analysis, Part 1] by [[Mathematician#TRoughgarden|Tim Roughgarden]], [[Stanford University]], [https://en.wikipedia.org/wiki/Coursera Coursera], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=SDgo4kVSiiw|alignment=left|valignment=top}}
* [https://en.wikipedia.org/wiki/Numerical_analysis Numerical analysis from Wikipedia]
* [https://en.wikipedia.org/wiki/Numerical_linear_algebra Numerical linear algebra from Wikipedia]
* [https://en.wikipedia.org/wiki/Pollard%27s_kangaroo_algorithm Pollard's kangaroo algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm Quine–McCluskey algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Rod_calculus Rod calculus from Wikipedia]
* [https://en.wikipedia.org/wiki/Root-finding_algorithm Root-finding algorithm from Wikipedia]
===Graphics===
* [https://en.wikipedia.org/wiki/Even-odd_rule Even-odd rule from Wikipedia]
* [https://en.wikipedia.org/wiki/Flood_fill Flood fill from Wikipedia]
* [https://en.wikipedia.org/wiki/Line_drawing_algorithm Line drawing algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Digital_Differential_Analyzer_%28graphics_algorithm%29 Digital Differential Analyzer (graphics algorithm)]
: [https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm Bresenham's line algorithm]
: [https://en.wikipedia.org/wiki/Xiaolin_Wu%27s_line_algorithm Xiaolin Wu's line algorithm]
* [https://en.wikipedia.org/wiki/Ray_tracing_%28graphics%29 Ray tracing (graphics) from Wikipedia]
* [https://en.wikipedia.org/wiki/Spline_interpolation Spline interpolation from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Boor%27s_algorithm De Boor's algorithm]
: [https://en.wikipedia.org/wiki/De_Casteljau%27s_algorithm De Casteljau's algorithm]
===[https://en.wikipedia.org/wiki/Linear_programming Linear Programming]===
* [https://en.wikipedia.org/wiki/Criss-cross_algorithm Criss-cross algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm Karmarkar's algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Simplex_algorithm Simplex algorithm from Wikipedia]
===Sorting and Searching===
* [https://en.wikipedia.org/wiki/Merge_algorithm Merge algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Search_algorithm Search algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/A* A* from Wikipedia]
: [https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Bellman–Ford algorithm]
: [https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm Dijkstra's algorithm]
: [https://en.wikipedia.org/wiki/Flooding_algorithm Flooding algorithm]
: [https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm Floyd–Warshall algorithm]
: [https://en.wikipedia.org/wiki/Greedy_algorithm Greedy algorithm]
: [https://en.wikipedia.org/wiki/Hill_climbing Hill climbing]
: [https://en.wikipedia.org/wiki/Kruskal%27s_algorithm Kruskal's algorithm]
: [https://en.wikipedia.org/wiki/Nearest_neighbour_algorithm Nearest neighbour algorithm]
: [https://en.wikipedia.org/wiki/String_searching_algorithm String searching algorithm]
* [https://en.wikipedia.org/wiki/Sorting_algorithm Sorting algorithm from Wikipedia]
==Complexity==
* [https://en.wikipedia.org/wiki/Category:Computational_complexity_theory Category: Computational complexity theory from Wikipedia]
* [https://en.wikipedia.org/wiki/Combinatorial_explosion Combinatorial explosion from Wikipedia]
* [https://en.wikipedia.org/wiki/Complexity Complexity from Wikipedia]
* [https://en.wikipedia.org/wiki/Complexity_class Complexity class from Wikipedia]
* [http://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by [[David Eppstein]]
* [https://en.wikipedia.org/wiki/Computational_complexity_theory Computational complexity theory from Wikipedia]
* [https://en.wikipedia.org/wiki/Game_complexity Game complexity from Wikipedia] » [[Games]]
* [https://en.wikipedia.org/wiki/Go_and_mathematics Go and mathematics from Wikipedia] » [[Go]]
* [https://en.wikipedia.org/wiki/List_of_complexity_classes List of complexity classes from Wikipedia]
* [https://en.wikipedia.org/wiki/Problem_solving Problem solving from Wikipedia] » [[Artificial Intelligence]]
* [https://en.wikipedia.org/wiki/Reduction_%28complexity%29 Reduction (complexity) from Wikipedia]
* [https://en.wikipedia.org/wiki/Shannon_number Shannon number from Wikipedia] » [[Claude Shannon]]
* [https://en.wikipedia.org/wiki/Time_complexity Time complexity from Wikipedia]
* [https://en.wikipedia.org/wiki/Wheat_and_chessboard_problem Wheat and chessboard problem from Wikipedia] » [[Chessboard]]
==Misc==
* [https://en.wikipedia.org/wiki/Correctness Correctness (disambiguation) from Wikipedia]
* [https://en.wikipedia.org/wiki/Correctness_%28computer_science%29 Correctness (computer science) from Wikipedia]
* [https://en.wikipedia.org/wiki/Halting_problem Halting problem from Wikipedia]
* [[Videos#Kraan|Kraan]] - [https://www.flashlyrics.com/lyrics/kraan/gut-und-richtig-03 Gut und Richtig] (1973), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=HjR320Y4NTQ|alignment=left|valignment=top}}
=References=
<references />
'''[[Programming|Up one Level]]'''
[[File:1983_CPA_5426_(1).png|thumb|right|[[Mathematician#Algoritmi|Muḥammad ibn Mūsā al-Khwārizmī]] <ref>A stamp issued September 6, 1983 in the [https://en.wikipedia.org/wiki/Soviet_Union Soviet Union]], commemorating [[Mathematician#Algoritmi|Al-Khwārizmī's]] (approximate) 1200th birthday</ref> ]]
'''Algorithms''',
in mathematics and computer science, methods for solving a problem expressed as a finite sequence of instructions. The term “algorithm” is derived from the name of [[Mathematician#Algoritmi|Muḥammad ibn Mūsā al-Khwārizmī]] (born approximately 780 in [https://en.wikipedia.org/wiki/Khwarezm Khwarezm], died between 835 and 850), the [https://en.wikipedia.org/wiki/Persian_people Persian] [https://en.wikipedia.org/wiki/Mathematics_in_medieval_Islam mathematician], [https://en.wikipedia.org/wiki/Astronomy_in_medieval_Islam astronomer], [https://en.wikipedia.org/wiki/Geography_and_cartography_in_medieval_Islam geographer], and scholar in the [https://en.wikipedia.org/wiki/House_of_Wisdom House of Wisdom] in [https://en.wikipedia.org/wiki/Baghdad Baghdad], from the [https://en.wikipedia.org/wiki/Khorasan_Province Khorasan province] of present-day [https://en.wikipedia.org/wiki/Uzbekistan Uzbekistan] <ref> [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/%7Emehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [http://www.mpi-inf.mpg.de/%7Emehlhorn/ftp/Toolbox/Appetizer.pdf Appetizer: Integer Arithmetics] (pdf)</ref> .
=General Concepts=
* [[General Setwise Operations]]
* [[Iteration]]
* [[Pseudorandom Number Generator]]
* [[Recursion]]
=Sorting and Searching=
* [[ABDADA]]
* [[All Shortest Paths|All shortest Paths]]
* [[Alpha-Beta]]
* [[B*]]
* [[Best-First]]
* [[Brute-Force]]
* [[Depth-First]]
* [[King Pattern#FloodFillAlgorithms|Flood Fill Algorithm]]
* [[Iterative Search]]
* [[Jamboree]]
* [[Monte-Carlo Tree Search]]
* [[Move Ordering]]
* [[MTD(f)]]
* [[NegaC*]]
* [[NegaScout]]
* [[Cilk#ParallelAlphaBeta|Parallel Alpha-Beta]] in [[Cilk]]
* [[Parallel Search]]
* [[Principal Variation Search]]
* [[Proof-Number Search]]
* [[Retrograde Analysis]]
* [[Search]]
* [[SEE - The Swap Algorithm]]
* [[SEX Algorithm]]
* [[SOMA#SOMAALGO|SOMA Algorithm]]
* [[SSS* and Dual*]]
* [[UCT]]
* [[Young Brothers Wait Concept]]
=Enumeration and Backtracking=
* [[Backtracking]]
* [[De Bruijn Sequence Generator]]
* [[Traversing Subsets of a Set]]
* [[Trial and Error]]
=Mathematical Optimization=
* [[CLOP]]
* [[Dynamic Programming]]
* [[Genetic Programming#EvolutionaryAlgorithms|Evolutionary Algorithms]]
* [[Hill Climbing]]
* [[Simulated Annealing]]
* [[SPSA]]
=Combinatorial=
* [[Bit-Twiddling]]
* [[BitScan]]
* [[Flipping Mirroring and Rotating]]
* [[Kogge-Stone Algorithm]]
* [[Parallel Prefix Algorithms]]
* [[Population Count]]
=See also=
* [[BCH Hashing]]
* [[Data]]
* [[Fill Algorithms]]
* [[Hash Table]]
* [[Learning]]
* [[Mathematician]]
* [[SIMD and SWAR Techniques]]
* [[Space-Time Tradeoff]]
* [[Zobrist Hashing]]
=Publications=
==1960 ...==
* [[Donald Knuth|Donald E. Knuth]] ('''1968 ...'''). ''[http://www-cs-faculty.stanford.edu/%7Eknuth/taocp.html The Art of Computer Programming (TAOCP)]'' <ref>[https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming The Art of Computer Programming from Wikipedia]</ref>
: Volume 1 - Fundamental Algorithms ('''1968''')
: Volume 2 - Seminumerical Algorithms ('''1969''')
: Volume 3 - Sorting and Searching ('''1973''')
: Volume 4 - Combinatorial Algorithms in preparation (five fascicles have been published as of April 2009)
: Volume 4A - Enumeration and Backtracking
: Volume 4B - Graph and Network Algorithms
: Volume 4C and possibly 4D - Optimization and Recursion
: Volume 5 - Syntactic Algorithms, planned (as of August 2006, estimated in 2015).
==1970 ...==
* [https://en.wikipedia.org/wiki/Niklaus_Wirth Niklaus Wirth] ('''1976'''). ''[https://en.wikipedia.org/wiki/Algorithms_%2B_Data_Structures_%3D_Programs Algorithms + Data Structures = Programs]''.
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1979'''). ''Algorithms of adaptive search''. [http://www.doc.ic.ac.uk/%7Eshm/MI/mi9.html Machine Intelligence 9] (eds. [[Jean Hayes Michie]], [[Donald Michie]] and L.I. Mikulich), pp. 373-384. Ellis Horwood, Chichester
==1980 ...==
* [[Mathematician#Ershov|Andrei P. Ershov]], [[Donald Knuth]] (Eds.) ('''1981'''). ''Algorithms in Modern Mathematics and Computer Science''. Proceedings, [https://en.wikipedia.org/wiki/Urgench Urgench], Uzbek SSR, September 16-22, 1979. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science], Vol. 122, Springer » [[Donald Knuth#ErshovArchive|Ershov Archive]]
* [[Michel Gondran]], [Mathematician#MMinoux|Michel Minoux]], [https://en.wikipedia.org/wiki/Steven_Vajda Steven Vajda] ('''1984'''). ''[http://portal.acm.org/citation.cfm?id=817 Graphs and Algorithms]''. [https://en.wikipedia.org/wiki/John_Wiley_%26_Sons John Wiley & Sons], [http://books.google.com/books?id=2uhQAAAAMAAJ google], [http://www.amazon.com/Graphs-Algorithms-Discreet-Mathematics-1-484/dp/0471103748 amazon]
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''Algorithms for Games''. Springer, [http://www.amazon.com/Algorithms-Games-Georgy-M-Adelson-Velsky/dp/0387966293 amazon.com]
==1990 ...==
* [[John Tromp]] ('''1993'''). ''[http://homepages.cwi.nl/~tromp/thesis.html Aspects of Algorithms and Complexity]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], advisor [[Mathematician#PVitany|Paul Vitányi]]
* [[Warren D. Smith]], [[Kevin J. Lang]] ('''1994'''). ''Values of the merging function and algorithm design as a game''. [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [http://scorevoting.net/WarrenSmithPages/homepage/mergepap.ps ps]
* [[Leen Ammeraal]] ('''1996'''). ''[http://home.planet.nl/%7Eammeraal/algds.html Algorithms and Data Structures in C++]''. Chichester: [http://eu.wiley.com/WileyCDA/Section/id-300022.html John Wiley]
* [[Steven Skiena]] ('''1998'''). ''The Algorithm Design Manual''. 2nd Edition 2008
* [[Harald Prokop]] ('''1999'''). ''Cache-Oblivious Algorithms''. Masters thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology|MIT]], [http://supertech.csail.mit.edu/papers/Prokop99.pdf pdf]
==2000 ...==
* [[Donald Knuth]] ('''2000'''). ''[http://www-cs-faculty.stanford.edu/~uno/aa.html Selected Papers on Analysis of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 102
* [[Richard C. T. Lee|R. C. T. Lee]], [http://www.arnetminer.org/viewperson.do?naid=833742&keyword=S.%20S.%20Tseng S. S. Tseng], [http://www.arnetminer.org/viewperson.do?naid=1257780&keyword=R.%20C.%20Chang R. C. Chang], [http://www.arnetminer.org/viewperson.do?naid=1419034&keyword=Yin-Te%20Tsai Y. T. Tsai] ('''2005'''). ''Introduction to the Design and Analysis of Algorithms, a Strategic Approach''. [https://en.wikipedia.org/wiki/McGraw-Hill McGraw-Hill], [http://www.amazon.com/Introduction-Design-Analysis-Algorithms-Y-T-Tsai/dp/0071243461 amazon]
* [[Jill Cirasella]] ('''2006'''). ''Classical and Quantum Algorithms for Finding Cycles''. [https://jillcirasella.commons.gc.cuny.edu/files/2014/05/quantum_and_classical_cycles_slides.pdf slides as pdf]
* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#UVVazirani|Umesh Vazirani]] ('''2006'''). ''[http://www.cs.berkeley.edu/%7Evazirani/algorithms.html Algorithms]''. [https://en.wikipedia.org/wiki/McGraw-Hill McGraw-Hill], [http://www.amazon.com/gp/product/0073523402?ie=UTF8&tag=ebookdire-20&link_code=as3&camp=211189&creative=373489&creativeASIN=0073523402 amazon]
* [http://info.iut-bm.univ-fcomte.fr/staff/bahi/ Jacques Bahi], [http://www.loria.fr/%7Econtasss/ Sylvain Contassot-Vivier], [[Raphaël Couturier]] ('''2007'''). ''[http://www.crcpress.com/ecommerce_product/product_detail.jsf?catno=C808X&isbn=0000000000000&parent_id=&pc= Parallel Iterative Algorithms: From Sequential to Grid Computing]''. [https://en.wikipedia.org/wiki/Chapman_%26_Hall Chapman & Hall]/CRC Numerical Analysis and Scientific Computing Series
* [[David J. Stracuzzi]] ('''2007'''). ''Randomized Feature Selection''. in [http://scholar.google.com/citations?user=Dzf46C8AAAAJ Huan Liu], [http://www.ar.sanken.osaka-u.ac.jp/~motoda/motopreg.html Hiroshi Motoda] (eds.) [http://www.crcpress.com/product/isbn/9781584888789 Computational Methods of Feature Selection]. [https://en.wikipedia.org/wiki/CRC_Press CRC Press], [http://www.stracuzzi.info/david/manuscripts/cmfs07-randomized.pdf pdf]
* [[Steven Skiena]] ('''2008'''). ''[http://www.springer.com/us/book/9781848000698 The Algorithm Design Manual]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], 2nd Edition
* [[Mathematician#KMehlhorn|Kurt Mehlhorn]], [[Peter Sanders]] ('''2008'''). ''[http://www.mpi-inf.mpg.de/%7Emehlhorn/Toolbox.html Data Structures and Algorithms: The Basic Toolbox]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Michel Gondran]], [[Mathematician#MMinoux|Michel Minoux]] ('''2008, 2010'''). ''[http://www.springer.com/mathematics/applications/book/978-0-387-75449-9 Graphs, dioids and semirings - New Models and Algorithms]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], from [http://books.google.com/books/about/Graphs_dioids_and_semirings.html?id=XudA1RktfCAC google], [http://www.amazon.com/Graphs-Dioids-Semirings-Algorithms-Operations/dp/1441945296/ref=ntt_at_ep_dpt_2 amazon.com], 2nd edition from [http://www.alibris.com/booksearch?qisbn=9781441945297 alibris.com] <ref>[https://en.wikipedia.org/wiki/Ordinal_optimization Ordinal optimization from Wikipedia]</ref>
* [[Mathematician#THCormen|Thomas H. Cormen]], [[Charles Leiserson|Charles E. Leiserson]], [[Ronald L. Rivest]], [[Mathematician#CliffordStein|Clifford Stein]] ('''2009'''). ''[https://en.wikipedia.org/wiki/Introduction_to_Algorithms Introduction to Algorithms, 3rd Edition]''.
==2010 ...==
* [[Donald Knuth]] ('''2010'''). ''[http://www-cs-faculty.stanford.edu/~uno/da.html Selected Papers on Design of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 191, [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press]
* [[Mathematician#BVoecking|Berthold Vöcking]] et al. (eds.) ('''2011'''). ''[http://www.springer.com/gp/book/9783642153273 Algorithms Unplugged]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Katja Grace]] ('''2013'''). ''Algorithmic Progress in Six Domains''. Technical report 2013-3, [https://en.wikipedia.org/wiki/Machine_Intelligence_Research_Institute Machine Intelligence Research Institute], [https://en.wikipedia.org/wiki/Berkeley,_California Berkeley, CA], [http://intelligence.org/files/AlgorithmicProgress.pdf pdf], 5 [[Games|Game Playing]], 5.1 [[Chess]], 5.2 [[Go]], 9 [[Learning|Machine Learning]]
=External Links=
* [https://en.wikipedia.org/wiki/Algorithm Algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Mu%E1%B8%A5ammad_ibn_M%C5%ABs%C4%81_al-Khw%C4%81rizm%C4%AB Muḥammad ibn Mūsā al-Khwārizmī]
* [https://en.wikipedia.org/wiki/Ban%C5%AB_M%C5%ABs%C4%81 Banū Mūsā from Wikipedia]
* [https://en.wikipedia.org/wiki/Algorithm_characterizations Algorithm characterizations from Wikipedia]
* [https://en.wikipedia.org/wiki/Analysis_of_algorithms Analysis of algorithms from Wikipedia]
* [https://en.wikipedia.org/wiki/Big_O_notation Big O notation from Wikipedia]
* [https://en.wikibooks.org/wiki/Algorithms Algorithms - Wikibooks]
* [http://xlinux.nist.gov/dads/ Dictionary of Algorithms and Data Structures] by [http://hissa.nist.gov/%7Eblack/ Paul E. Black], [https://en.wikipedia.org/wiki/National_Institute_of_Standards_and_Technology National Institute of Standards and Technology]
* [https://en.wikipedia.org/wiki/Dictionary_of_Algorithms_and_Data_Structures Dictionary of Algorithms and Data Structures from Wikipedia]
* [http://aggregate.org/MAGIC The Aggregate Magic Algorithms] by [[Hank Dietz]] » [[Bit-Twiddling]]
* [http://webhome.cs.uvic.ca/%7Evanemden/mathart/mathart.html Algorithmic Art] by [[Maarten van Emden]]
* [https://en.wikipedia.org/wiki/The_Art_of_Computer_Programming The Art of Computer Programming from Wikipedia]
* [[Java]] [http://code.google.com/p/aima-java/ implementation of algorithms] from [[Peter Norvig|Norvig]] and [[Stuart Russell|Russell's]] ''[http://aima.cs.berkeley.edu/ Artificial Intelligence: A Modern Approach]''. 3rd edition
==Algorithms==
* [https://en.wikipedia.org/wiki/Category:Algorithms Category:Algorithms from Wikipedia]
: [https://en.wikipedia.org/wiki/Algorithms_for_calculating_variance Algorithms for calculating variance]
: [https://en.wikipedia.org/wiki/Approximation_algorithm Approximation algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms Cryptographic hash algorithms]
: [https://en.wikipedia.org/wiki/Divide_and_conquer_algorithm Divide and conquer algorithm]
* [https://en.wikipedia.org/wiki/List_of_algorithms List of algorithms from Wikipedia]
: [https://en.wikipedia.org/wiki/Deterministic_algorithm Deterministic algorithm]
: [https://en.wikipedia.org/wiki/Distributed_algorithms Distributed algorithms]
: [https://en.wikipedia.org/wiki/Nondeterministic_algorithm Nondeterministic algorithm]
: [https://en.wikipedia.org/wiki/Metaheuristic Metaheuristic]
: [https://en.wikipedia.org/wiki/Parallel_algorithm Parallel algorithm]
: [https://en.wikipedia.org/wiki/Quantum_algorithm Quantum algorithm]
* [https://en.wikipedia.org/wiki/Randomized_algorithm Randomized algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Las_Vegas_algorithm Las Vegas algorithm]
: [https://en.wikipedia.org/wiki/Monte_Carlo_algorithm Monte Carlo algorithm]
: [https://en.wikipedia.org/wiki/Pseudorandom_number_generator Pseudorandom number generator]
===[https://en.wikipedia.org/wiki/Abstract_algebra Algebra] and [https://en.wikipedia.org/wiki/Calculus Calculus]===
* [https://en.wikipedia.org/wiki/Algorism Algorism from Wikipedia]
* [https://en.wikipedia.org/wiki/Berlekamp%27s_algorithm Berlekamp's algorithm from Wikipedia] » [[Elwyn Berlekamp]]
* [https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Massey_algorithm Berlekamp–Massey algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Buchberger%27s_algorithm Buchberger's algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Cantor%E2%80%93Zassenhaus_algorithm Cantor–Zassenhaus algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Computus Computus from Wikipedia]
* [https://en.wikipedia.org/wiki/Divisibility_rule Divisibility rule from Wikipedia]
* [https://en.wikipedia.org/wiki/Division_%28digital%29 Division (digital) from Wikipedia]
* [https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Gaussian_elimination Gaussian elimination from Wikipedia]
* [https://en.wikipedia.org/wiki/Gauss%E2%80%93Newton_algorithm Gauss–Newton algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Householder%27s_method Householder's method from Wikipedia]
* [https://en.wikipedia.org/wiki/Kuwaiti_algorithm Kuwaiti algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Levenberg%E2%80%93Marquardt_algorithm Levenberg–Marquardt algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Multiplication_algorithm Multiplication algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm from Wikipedia]
: [https://www.coursera.org/learn/algorithm-design-analysis Algorithms: Design and Analysis, Part 1] by [[Mathematician#TRoughgarden|Tim Roughgarden]], [[Stanford University]], [https://en.wikipedia.org/wiki/Coursera Coursera], [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=SDgo4kVSiiw|alignment=left|valignment=top}}
* [https://en.wikipedia.org/wiki/Numerical_analysis Numerical analysis from Wikipedia]
* [https://en.wikipedia.org/wiki/Numerical_linear_algebra Numerical linear algebra from Wikipedia]
* [https://en.wikipedia.org/wiki/Pollard%27s_kangaroo_algorithm Pollard's kangaroo algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm Quine–McCluskey algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Rod_calculus Rod calculus from Wikipedia]
* [https://en.wikipedia.org/wiki/Root-finding_algorithm Root-finding algorithm from Wikipedia]
===Graphics===
* [https://en.wikipedia.org/wiki/Even-odd_rule Even-odd rule from Wikipedia]
* [https://en.wikipedia.org/wiki/Flood_fill Flood fill from Wikipedia]
* [https://en.wikipedia.org/wiki/Line_drawing_algorithm Line drawing algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/Digital_Differential_Analyzer_%28graphics_algorithm%29 Digital Differential Analyzer (graphics algorithm)]
: [https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm Bresenham's line algorithm]
: [https://en.wikipedia.org/wiki/Xiaolin_Wu%27s_line_algorithm Xiaolin Wu's line algorithm]
* [https://en.wikipedia.org/wiki/Ray_tracing_%28graphics%29 Ray tracing (graphics) from Wikipedia]
* [https://en.wikipedia.org/wiki/Spline_interpolation Spline interpolation from Wikipedia]
: [https://en.wikipedia.org/wiki/De_Boor%27s_algorithm De Boor's algorithm]
: [https://en.wikipedia.org/wiki/De_Casteljau%27s_algorithm De Casteljau's algorithm]
===[https://en.wikipedia.org/wiki/Linear_programming Linear Programming]===
* [https://en.wikipedia.org/wiki/Criss-cross_algorithm Criss-cross algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm Karmarkar's algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Simplex_algorithm Simplex algorithm from Wikipedia]
===Sorting and Searching===
* [https://en.wikipedia.org/wiki/Merge_algorithm Merge algorithm from Wikipedia]
* [https://en.wikipedia.org/wiki/Search_algorithm Search algorithm from Wikipedia]
: [https://en.wikipedia.org/wiki/A* A* from Wikipedia]
: [https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm Bellman–Ford algorithm]
: [https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm Dijkstra's algorithm]
: [https://en.wikipedia.org/wiki/Flooding_algorithm Flooding algorithm]
: [https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm Floyd–Warshall algorithm]
: [https://en.wikipedia.org/wiki/Greedy_algorithm Greedy algorithm]
: [https://en.wikipedia.org/wiki/Hill_climbing Hill climbing]
: [https://en.wikipedia.org/wiki/Kruskal%27s_algorithm Kruskal's algorithm]
: [https://en.wikipedia.org/wiki/Nearest_neighbour_algorithm Nearest neighbour algorithm]
: [https://en.wikipedia.org/wiki/String_searching_algorithm String searching algorithm]
* [https://en.wikipedia.org/wiki/Sorting_algorithm Sorting algorithm from Wikipedia]
==Complexity==
* [https://en.wikipedia.org/wiki/Category:Computational_complexity_theory Category: Computational complexity theory from Wikipedia]
* [https://en.wikipedia.org/wiki/Combinatorial_explosion Combinatorial explosion from Wikipedia]
* [https://en.wikipedia.org/wiki/Complexity Complexity from Wikipedia]
* [https://en.wikipedia.org/wiki/Complexity_class Complexity class from Wikipedia]
* [http://www.ics.uci.edu/~eppstein/cgt/hard.html Computational Complexity of Games and Puzzles] by [[David Eppstein]]
* [https://en.wikipedia.org/wiki/Computational_complexity_theory Computational complexity theory from Wikipedia]
* [https://en.wikipedia.org/wiki/Game_complexity Game complexity from Wikipedia] » [[Games]]
* [https://en.wikipedia.org/wiki/Go_and_mathematics Go and mathematics from Wikipedia] » [[Go]]
* [https://en.wikipedia.org/wiki/List_of_complexity_classes List of complexity classes from Wikipedia]
* [https://en.wikipedia.org/wiki/Problem_solving Problem solving from Wikipedia] » [[Artificial Intelligence]]
* [https://en.wikipedia.org/wiki/Reduction_%28complexity%29 Reduction (complexity) from Wikipedia]
* [https://en.wikipedia.org/wiki/Shannon_number Shannon number from Wikipedia] » [[Claude Shannon]]
* [https://en.wikipedia.org/wiki/Time_complexity Time complexity from Wikipedia]
* [https://en.wikipedia.org/wiki/Wheat_and_chessboard_problem Wheat and chessboard problem from Wikipedia] » [[Chessboard]]
==Misc==
* [https://en.wikipedia.org/wiki/Correctness Correctness (disambiguation) from Wikipedia]
* [https://en.wikipedia.org/wiki/Correctness_%28computer_science%29 Correctness (computer science) from Wikipedia]
* [https://en.wikipedia.org/wiki/Halting_problem Halting problem from Wikipedia]
* [[Videos#Kraan|Kraan]] - [https://www.flashlyrics.com/lyrics/kraan/gut-und-richtig-03 Gut und Richtig] (1973), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=HjR320Y4NTQ|alignment=left|valignment=top}}
=References=
<references />
'''[[Programming|Up one Level]]'''
.png){kind=link}