Resultado de API de MediaWiki
Esta é a representación HTML do formato JSON. O HTML é bo para depurar, pero non é axeitado para usar nunha aplicación.
Especifica o parámetro format para cambiar o formato de saída. Para ver a representación non HTML do formato JSON, define format=json.
Consulta a documentación completa ou a axuda da API para obter máis información.
{
"compare": {
"fromid": 1,
"fromrevid": 1,
"fromns": 0,
"fromtitle": "Portada",
"toid": 2,
"torevid": 2,
"tons": 0,
"totitle": "Algoritmo",
"*": "<tr><td colspan=\"2\" class=\"diff-lineno\" id=\"mw-diff-left-l1\">Li\u00f1a 1:</td>\n<td colspan=\"2\" class=\"diff-lineno\">Li\u00f1a 1:</td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div><<del class=\"diffchange diffchange-inline\">strong</del>><del class=\"diffchange diffchange-inline\">Instalouse MediaWiki.</del></<del class=\"diffchange diffchange-inline\">strong</del>></div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">{{1000}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">[[Ficheiro:Euclid flowchart 1.png|miniatura|[[Diagrama de fluxo]] do [[algoritmo de Euclides]].]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Un '''algoritmo'''</ins><<ins class=\"diffchange diffchange-inline\">ref</ins>><ins class=\"diffchange diffchange-inline\">{{DRAG|algoritmo}}</ins></<ins class=\"diffchange diffchange-inline\">ref</ins>> <ins class=\"diffchange diffchange-inline\">\u00e9 un [[conxunto]] ordenado e finito de [[C\u00e1lculo|operaci\u00f3ns]] sinxelas que conducen \u00e1 resoluci\u00f3n dun [[problema]], como por exemplo a formulaci\u00f3n program\u00e1tica paso a paso para producir unha serie de resultados nun programa en [[inform\u00e1tica]]. M\u00e1is especificamente, en [[matem\u00e1ticas]], constit\u00fae o conxunto de procesos (e [[s\u00edmbolo]]s que os representan) para efectuar un [[c\u00e1lculo]].</ins></div></td></tr>\n<tr><td class=\"diff-marker\"></td><td class=\"diff-context diff-side-deleted\"><br></td><td class=\"diff-marker\"></td><td class=\"diff-context diff-side-added\"><br></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div><del class=\"diffchange diffchange-inline\">Consulte a </del>[https://<del class=\"diffchange diffchange-inline\">www</del>.<del class=\"diffchange diffchange-inline\">mediawiki.org</del>/<del class=\"diffchange diffchange-inline\">wiki</del>/<del class=\"diffchange diffchange-inline\">Special:MyLanguage</del>/<del class=\"diffchange diffchange-inline\">Help:Contents gu\u00eda </del>de <del class=\"diffchange diffchange-inline\">usuario] para obter m\u00e1is informaci\u00f3n </del>sobre <del class=\"diffchange diffchange-inline\">como usar </del>o <del class=\"diffchange diffchange-inline\">software wiki</del>.</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">A palabra ''algoritmo'' ten orixe no alcume [[Al-Khwarizmi]], do matem\u00e1tico [[Persia|persa]] do [</ins>[<ins class=\"diffchange diffchange-inline\">s\u00e9culo IX]], Abu Yafar Moh\u00e1mmed Abenmusa,<ref></ins>https://<ins class=\"diffchange diffchange-inline\">portaldaspalabras</ins>.<ins class=\"diffchange diffchange-inline\">gal/lexico/mira-que-din</ins>/<ins class=\"diffchange diffchange-inline\">algoritmo</ins>/<ins class=\"diffchange diffchange-inline\"><</ins>/<ins class=\"diffchange diffchange-inline\">ref> cuxas obras foron traducidas no occidente cristi\u00e1n no [[s\u00e9culo XII]], recibindo unha delas o nome \"Algorithmi </ins>de <ins class=\"diffchange diffchange-inline\">numero indorum\", </ins>sobre <ins class=\"diffchange diffchange-inline\">os algoritmos usando </ins>o <ins class=\"diffchange diffchange-inline\">sistema de numeraci\u00f3n decimal (indiano). Outros autores, con todo, defenden a orixe da palabra en ''Al-goreten'' (ra\u00edz - concepto que se pode aplicar aos c\u00e1lculos)</ins>.</div></td></tr>\n<tr><td class=\"diff-marker\"></td><td class=\"diff-context diff-side-deleted\"><br></td><td class=\"diff-marker\"></td><td class=\"diff-context diff-side-added\"><br></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div>== <del class=\"diffchange diffchange-inline\">Primeiros pasos </del>==</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">O concepto de algoritmo \u00e9 frecuentemente ilustrado co exemplo dunha [[receita]], a\u00ednda que moitos algoritmos son m\u00e1is complexos. Eles poden repetir pasos (facer interacci\u00f3ns) ou necesitar decisi\u00f3ns (tales como comparaci\u00f3ns ou [[l\u00f3xica]]) ata que a tarefa sexa completada. Un algoritmo correctamente executado non resolver\u00e1 un problema se o algoritmo fose incorrecto ou non fose apropiado ao problema.</ins></div></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div><del class=\"diffchange diffchange-inline\">* </del>[https://www.<del class=\"diffchange diffchange-inline\">mediawiki</del>.org/<del class=\"diffchange diffchange-inline\">wiki</del>/<del class=\"diffchange diffchange-inline\">Special</del>:<del class=\"diffchange diffchange-inline\">MyLanguage</del>/<del class=\"diffchange diffchange-inline\">Manual</del>:<del class=\"diffchange diffchange-inline\">Configuration_settings Lista das opci\u00f3ns </del>de <del class=\"diffchange diffchange-inline\">configuraci\u00f3n</del>]</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div><del class=\"diffchange diffchange-inline\">* </del>[https://www.<del class=\"diffchange diffchange-inline\">mediawiki</del>.org/<del class=\"diffchange diffchange-inline\">wiki</del>/<del class=\"diffchange diffchange-inline\">Special</del>:<del class=\"diffchange diffchange-inline\">MyLanguage</del>/<del class=\"diffchange diffchange-inline\">Manual</del>:<del class=\"diffchange diffchange-inline\">FAQ Preguntas </del>m\u00e1is <del class=\"diffchange diffchange-inline\">frecuentes sobre MediaWiki</del>]</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Un algoritmo non representa, necesariamente, un [[programa de computador]], e si os pasos necesarios para realizar unha tarefa. A s\u00faa posta en funcionamento pode ser feita por un [[computador]], por outro tipo de [[aut\u00f3mata]] ou mesmo por un ser humano. Diferentes algoritmos poden realizar a mesma tarefa usando un conxunto diferenciado de instruci\u00f3ns en m\u00e1is ou menos tempo, espazo ou esforzo que outros. Por exemplo, un algoritmo para se vestir pode especificar que vostede vista primeiro as medias e os zapatos antes de vestir o pantal\u00f3n, en canto outro algoritmo especifica que vostede debe primeiro vestir o pantal\u00f3n e despois as medias e os zapatos. Fica claro que o primeiro algoritmo \u00e9 m\u00e1is dif\u00edcil de executar que o segundo.</ins></div></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div><del class=\"diffchange diffchange-inline\">* </del>[https://<del class=\"diffchange diffchange-inline\">lists</del>.<del class=\"diffchange diffchange-inline\">wikimedia</del>.org/<del class=\"diffchange diffchange-inline\">postorius</del>/<del class=\"diffchange diffchange-inline\">lists</del>/<del class=\"diffchange diffchange-inline\">mediawiki</del>-<del class=\"diffchange diffchange-inline\">announce</del>.<del class=\"diffchange diffchange-inline\">lists</del>.<del class=\"diffchange diffchange-inline\">wikimedia</del>.org/ <del class=\"diffchange diffchange-inline\">Lista </del>de <del class=\"diffchange diffchange-inline\">correo </del>dos <del class=\"diffchange diffchange-inline\">lanzamentos </del>de <del class=\"diffchange diffchange-inline\">MediaWiki</del>]</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div><del class=\"diffchange diffchange-inline\">* </del>[https://<del class=\"diffchange diffchange-inline\">www</del>.<del class=\"diffchange diffchange-inline\">mediawiki</del>.org/<del class=\"diffchange diffchange-inline\">wiki</del>/<del class=\"diffchange diffchange-inline\">Special</del>:<del class=\"diffchange diffchange-inline\">MyLanguage</del>/<del class=\"diffchange diffchange-inline\">Localisation#Translation_resources Localice MediaWiki </del>\u00e1 s\u00faa <del class=\"diffchange diffchange-inline\">lingua</del>]</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>== <ins class=\"diffchange diffchange-inline\">Etimolox\u00eda </ins>==</div></td></tr>\n<tr><td class=\"diff-marker\" data-marker=\"\u2212\"></td><td class=\"diff-deletedline diff-side-deleted\"><div>* [https://www.<del class=\"diffchange diffchange-inline\">mediawiki</del>.org/<del class=\"diffchange diffchange-inline\">wiki</del>/<del class=\"diffchange diffchange-inline\">Special</del>:<del class=\"diffchange diffchange-inline\">MyLanguage</del>/<del class=\"diffchange diffchange-inline\">Manual</del>:<del class=\"diffchange diffchange-inline\">Combating_spam Aprenda como combater a spam no seu wiki</del>]</div></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">O voc\u00e1bulo ''algoritmo'' ten as s\u00faas ra\u00edces na latinizaci\u00f3n do ''nisba'', que indica a orixe xeogr\u00e1fica, do nome do matem\u00e1tico persa [</ins>[<ins class=\"diffchange diffchange-inline\">Muhammad ibn Musa al-Khwarizmi]] como ''algorismus''.<ref>{{cita web|url=http://www-history.mcs.st-andrews.ac.uk/Biographies/Al-Khwarizmi.html|title=Al-Khwarizmi biography|website=www-history.mcs.st-andrews.ac.uk|access-date=3 de maio de 2017|archive-url=</ins>https<ins class=\"diffchange diffchange-inline\">://web.archive.org/web/20190802091553/http</ins>://www<ins class=\"diffchange diffchange-inline\">-history.mcs.st-andrews.ac.uk/Biographies/Al-Khwarizmi.html|archive-date=2 de agosto de 2019}}</ref><ref>{{cita web|title=Etymology of algorithm|url=http://chambers.co.uk/search/?query=algorithm&title=21st|website=Chambers Dictionary|accessdate=13 de decembro de 2016|archive-url=https://web</ins>.<ins class=\"diffchange diffchange-inline\">archive</ins>.org/<ins class=\"diffchange diffchange-inline\">web/20190331204600</ins>/<ins class=\"diffchange diffchange-inline\">https</ins>:/<ins class=\"diffchange diffchange-inline\">/chambers.co.uk/search/?query=algorithm&title=21st|archive-date=31 de marzo de 2019}}</ref> Al-Khw\u0101rizm\u012b (\u0627\u0644\u062e\u0648\u0627\u0631\u0632\u0645\u06cc c. 780\u2013850) foi un matem\u00e1tico, astr\u00f3nomo, xe\u00f3grafo e estudoso da [[Casa da Sabedor\u00eda]] de [[Bagdad]],<ref name=\"Hellenistic Mathematics\">{{Cite web |url=http</ins>:<ins class=\"diffchange diffchange-inline\">//www.storyofmathematics.com/hellenistic.html |title=Hellenistic Mathematics |publisher=The Story of Mathematics |access-date=2019-11-14 |archive-url=https://web.archive.org/web/20190911042247/http://www.storyofmathematics.com/hellenistic.html|archive-date=September 11, 2019 }}</ref> e o seu nome significa \"natural </ins>de <ins class=\"diffchange diffchange-inline\">[[Khwarazm</ins>]<ins class=\"diffchange diffchange-inline\">]\", rexi\u00f3n que fac\u00eda parte do [[Grande Ir\u00e1n]] e actualmente pertence a [</ins>[<ins class=\"diffchange diffchange-inline\">Uzbekist\u00e1n]].<ref name=\"Hogendijk\">{{cita publicaci\u00f3n peri\u00f3dica|first=Jan P. |last=Hogendijk |title=al-Khwarzimi |journal=Pythagoras |volume=38 |issue=2 |year=1998 |pages=4\u20135 |url=http://www.kennislink.nl/web/show?id=116543 |ref=harv|archiveurl=</ins>https<ins class=\"diffchange diffchange-inline\">://web.archive.org/web/20090412193516/http</ins>://www.<ins class=\"diffchange diffchange-inline\">kennislink.nl/web/show?id=116543 |archivedate=12 de abril de 2009 }}</ref><ref name=\"Oaks\">{{cita web|first=Jeffrey A.|last=Oaks|url=http://facstaff.uindy.edu/~oaks/MHMC.htm|title=Was al-Khwarizmi an applied algebraist?|publisher=[[University of Indianapolis]]|accessdate=30 de maio de 2008|archive-url=https://web.archive</ins>.org/<ins class=\"diffchange diffchange-inline\">web</ins>/<ins class=\"diffchange diffchange-inline\">20110718094835/http</ins>:/<ins class=\"diffchange diffchange-inline\">/facstaff.uindy.edu/~oaks/MHMC.htm|archive-date=18 de xullo de 2011|df=mdy-all|url-morta=yes}}</ref></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Arredor de 825, al-Khwarizmi escribiu un tratado en [[lingua \u00e1rabe|\u00e1rabe]] sobre o [[sistema de numeraci\u00f3n indoar\u00e1bigo]], que foi traducido ao [[lingua latina|lat\u00edn]] durante o s\u00e9culo XII. O manuscrito comeza coa frase ''Dixit Algorizmi'' (\"As\u00ed falou Al-Khwarizmi\"), onde \"Algorizmi\" foi a latinizaci\u00f3n do nome de Al-Khwarizmi que fixo o tradutor.<ref>{{cita libro| last = Brezina| first = Corona| title = Al-Khwarizmi</ins>: <ins class=\"diffchange diffchange-inline\">The Inventor Of Algebra| url = https://books.google.com/books?id=955jPgAACAAJ| year = 2006| publisher = The Rosen Publishing Group| isbn = 978-1-4042-0513-0}}</ref> Al-Khwarizmi foi o matem\u00e1tico </ins>m\u00e1is <ins class=\"diffchange diffchange-inline\">lido en Europa a finais da idade media, especialmente por outro dos seus libros, ''[[Al-Jabr|\u00c1lxebra]</ins>]<ins class=\"diffchange diffchange-inline\">''.<ref></ins>[<ins class=\"diffchange diffchange-inline\">http://www-history.mcs.st-and.ac.uk/Extras/Boyer_Foremost_Text.html Foremost mathematical texts in history] {{Webarchive|url=</ins>https://<ins class=\"diffchange diffchange-inline\">web</ins>.<ins class=\"diffchange diffchange-inline\">archive</ins>.org/<ins class=\"diffchange diffchange-inline\">web</ins>/<ins class=\"diffchange diffchange-inline\">20110609224820</ins>/<ins class=\"diffchange diffchange-inline\">http://www</ins>-<ins class=\"diffchange diffchange-inline\">history.mcs.st-and.ac.uk/Extras/Boyer_Foremost_Text.html |date=9 de xu\u00f1o de 2011}}, segundo [[Carl B. Boyer]]</ins>.<ins class=\"diffchange diffchange-inline\"></ref> No lat\u00edn medieval final, ''algorismus'' significaba simplemente \"sistema de numeraci\u00f3n decimal\".<ref>{{cita web|title=algorismic|url=https://www</ins>.<ins class=\"diffchange diffchange-inline\">thefreedictionary.com/algorismic|work=The Free Dictionary|access-date=2019-11-14|archive-url=https://web.archive</ins>.org/<ins class=\"diffchange diffchange-inline\">web/20191221200124/https://www.thefreedictionary.com/algorismic|archive-date=21 de decembro de 2019}}</ref> No s\u00e9culo XV, pola influencia da palabra grega \u1f00\u03c1\u03b9\u03b8\u03bc\u03cc\u03c2 (''arithmos''), \"n\u00famero\", a palabra latina alterouse a ''algorithmus''. O voc\u00e1bulo ingl\u00e9s ''algorithm'' foi recollido no s\u00e9culo XVII e o sentido moderno da expresi\u00f3n d\u00e9uselle no s\u00e9culo XIX.<ref>''[[Oxford English Dictionary]]'', Third Edition, 2012 [http://www.oed.com/view/Entry/4959 ''s.v.'']</ref></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Algoritmos e linguaxes de programaci\u00f3n de computadores ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Xeralmente, os algoritmos descr\u00edbense informalmente nunha linguaxe pr\u00f3xima da [[lingua natural]], m\u00e1is facilmente comprendida por un ser humano que por un [[computador]]. Un algoritmo pode, na maior parte dos casos, ser aplicado en calquera [[linguaxe de programaci\u00f3n]].</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Formalizando algoritmos ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Un programa </ins>de <ins class=\"diffchange diffchange-inline\">computador \u00e9 esencialmente un algoritmo que di ao computador os pasos espec\u00edficos e en que orde eles deben ser executados, como por exemplo, os pasos a seren tomados para calcular as notas que ser\u00e1n impresas nos bolet\u00edns </ins>dos <ins class=\"diffchange diffchange-inline\">alumnos dunha escola.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Para calquera proceso computacional, o algoritmo precisa estar rigorosamente definido, especificando como se comportar\u00e1 en todas as circunstancias.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">A correcci\u00f3n do algoritmo pode ser probada matematicamente, ben como a cantidade asint\u00f3tica </ins>de <ins class=\"diffchange diffchange-inline\">tempo e espazo (complexidade) necesarios para a s\u00faa execuci\u00f3n. Estes aspectos dos algoritmos son materia da [[an\u00e1lise de algoritmos</ins>]<ins class=\"diffchange diffchange-inline\">].</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Posta en funcionamento ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Hai hoxe unha gran variedade de linguaxes de programaci\u00f3n, cada unha con caracter\u00edsticas espec\u00edficas que poden facilitar a aplicaci\u00f3n de determinados algoritmos ou atender a prop\u00f3sitos m\u00e1is xerais.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Os algoritmos non se po\u00f1en en funcionamento s\u00f3 como programas para computadores, sen\u00f3n que tam\u00e9n se poden aplicar en [[Circu\u00edto el\u00e9ctrico|circu\u00edtos el\u00e9ctricos]] ou ata no noso [[cerebro]] cando executamos operaci\u00f3ns [[aritm\u00e9tica]]s. A an\u00e1lise de algoritmos \u00e9 unha rama da [[ciencia da computaci\u00f3n]] que estuda as [[t\u00e9cnicas de proxecto de algoritmos]] e os algoritmos de forma abstracta, sen estaren aplicados nunha linguaxe de programaci\u00f3n en particular ou dalg\u00fan outro modo. Un medio de exhibir un algoritmo \u00e9 mostrar o seu [[pseudoc\u00f3digo]].</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Algoritmos como funci\u00f3ns ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">[[Ficheiro:Esquem\u00e1ticaAlgoritmo1.svg|miniatura|Esquema dun algoritmo que soluciona un problema de [[Cami\u00f1o hamiltoniano|ciclo hamiltoniano]].|400 px]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Un algoritmo pode concibirse como unha [[Funci\u00f3n matem\u00e1tica|funci\u00f3n]] que transforma os datos dun [[Problema abstracto|problema]] (entrada) nos datos dunha soluci\u00f3n (sa\u00edda). A\u00ednda m\u00e1is, os datos poden representarse \u00e1 s\u00faa vez como secuencias de [</ins>[<ins class=\"diffchange diffchange-inline\">bit]]s, e en xeral, de s\u00edmbolos calquera.<ref name=\"Kelley\">{{cita libro</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |apelidos\u00a0 \u00a0 = Kelley</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |nome\u00a0 \u00a0 \u00a0 \u00a0 = Dean</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |url\u00a0 \u00a0 \u00a0 \u00a0 = http://krypton.mnsu.edu/~kelled/</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |editorial\u00a0 = Prentice Hall</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |t\u00edtulo\u00a0 \u00a0 = Teor\u00eda de Aut\u00f3matas y Lenguajes Formales</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |ano\u00a0 \u00a0 \u00a0 \u00a0 = 1995</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |isbn\u00a0 \u00a0 \u00a0 \u00a0 = 0-13-497777-7</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |dataacceso\u00a0 = 22 de maio de 2016</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |urlarquivo\u00a0 = </ins>https://<ins class=\"diffchange diffchange-inline\">web</ins>.<ins class=\"diffchange diffchange-inline\">archive</ins>.org/<ins class=\"diffchange diffchange-inline\">web/20121114162557/http://krypton.mnsu.edu/~kelled/</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |dataarquivo = 14 de novembro de 2012</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> |urlmorta\u00a0 \u00a0 = yes</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">}}</ref> Como cada secuencia de bits representa un [[n\u00famero natural]], ent\u00f3n os algoritmos son en esencia funci\u00f3ns dos n\u00fameros naturais nos n\u00fameros naturais que si se poden calcular. \u00c9 dicir que todo algoritmo calcula unha funci\u00f3n <math>f:\\mathbf N\\to \\mathbf N</math> onde cada n\u00famero natural \u00e9 a [[Teor\u00eda de c\u00f3digos|codificaci\u00f3n]] dun problema ou dunha soluci\u00f3n.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">En ocasi\u00f3ns os algoritmos son susceptibles de non rematar nunca, por exemplo, cando entran nun [[bucle infinito]]. Cando ocorre isto, o algoritmo nunca devolve ning\u00fan valor de sa\u00edda, e podemos dicir que a funci\u00f3n queda indefinida para ese valor de entrada. Por esta raz\u00f3n consid\u00e9rase que os algoritmos son [[Funci\u00f3n parcial|funci\u00f3ns parciais]], \u00e9 dicir, non necesariamente definidas en todo o seu [[dominio de definici\u00f3n]].</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Cando unha funci\u00f3n pode ser calculada por medios algor\u00edtmicos, sen importar a cantidade de memoria que ocupe ou o tempo que se tarde, dise que esa funci\u00f3n \u00e9 [[Funci\u00f3n comput\u00e1bel|computable]]. Non todas as funci\u00f3ns entre secuencias datos son computables. O [[problema da parada]] \u00e9 un exemplo.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Exemplo de algoritmo ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">O problema consiste en atopar o m\u00e1ximo dun conxunto de n\u00fameros.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">=== Descrici\u00f3n de alto nivel ===</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Dado un [[conxunto]] finito <math>C</math> de n\u00fameros, tense o problema de atopar o n\u00famero m\u00e1is grande. Sen perda de xeneralidade pode asumirse que ese conxunto non \u00e9 baleiro e que os seus elementos est\u00e1n numerados como <math>c_0,c_1,\\dots,c_n</math>.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00c9 dicir, dado un conxunto <math>C=\\{c_0,c_1,\\dots,c_n\\}</math> p\u00eddese atopar <math>m</math> tal que <math>x\\leq m</math> para todo elemento <math>x</math> que pertence ao conxunto <math>C</math>.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Para atopar o elemento m\u00e1ximo, as\u00famese que o primeiro elemento (<math>c_0</math>) \u00e9 o m\u00e1ximo; despois, perc\u00f3rrese o conxunto e comp\u00e1rase cada valor co valor do m\u00e1ximo n\u00famero atopado ata ese momento. No caso no que un elemento sexa maior que o m\u00e1ximo, as\u00edgnase o seu valor ao m\u00e1ximo. Cando se termina de percorrer a lista, o m\u00e1ximo n\u00famero que se atopou \u00e9 o m\u00e1ximo de todo o conxunto.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">=== Descrici\u00f3n formal ===</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">O algoritmo pode ser escrito dunha maneira m\u00e1is formal no seguinte [[pseudoc\u00f3digo]]:</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">{{cita|Atopar o m\u00e1ximo dun conxunto:</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">'''funci\u00f3n''' max(<math>C</math>)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> //<math>C</math> \u00e9 un conxunto non baleiro de n\u00fameros//</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> <math>n</math> \u2190 <math>|C|<</ins>/<ins class=\"diffchange diffchange-inline\">math> //<math>|C|</math> \u00e9 o n\u00famero de elementos de <math>C</math>//</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> <math>m</math> \u2190 <math>c_0</math></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> '''para''' <math>i</math> \u2190 <math>1</math> '''ata''' <math>n</math> '''facer'''</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 '''se''' <math>c_i > m</math> '''ent\u00f3n'''</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 <math>m</math> \u2190 <math>c_i</math></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> '''devolver''' <math>m</math></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Sobre a notaci\u00f3n:</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* \"\u2190\" representa unha asignaci\u00f3n</ins>: <ins class=\"diffchange diffchange-inline\"><math>m</math> \u2190 <math>x</math> significa que a variable <math>m<</ins>/<ins class=\"diffchange diffchange-inline\">math> toma o valor de <math>x</math>;</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* \"'''devolver'''\" termina o algoritmo e d\u00e1 o valor </ins>\u00e1 s\u00faa <ins class=\"diffchange diffchange-inline\">dereita (neste caso, o m\u00e1ximo de <math>C</math>).</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">=== Posta en funcionamento ===</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">En linguaxe [[C++]]:</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"><syntaxhighlight lang=\"c\"></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">int max(int c[], int n)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">{</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 int i, m = c[0];</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 for (i = 1; i < n; i++)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 \u00a0 if (c[i] > m) m = c[i];</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 return m;</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"></syntaxhighlight></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Exemplo en pseudoc\u00f3digo ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Exemplo dun algoritmo que devolve a suma de dous valores (tam\u00e9n co\u00f1ecidos como [[par\u00e1metro]]s ou argumentos) que son introducidos na chamada da funci\u00f3n:</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"><pre></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> funci\u00f3n SumaDeDousValores (A num\u00e9rico, B num\u00e9rico)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> {</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 declara SUMA num\u00e9rico</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 SUMA <-- A + B</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 retorna SUMA</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"> }</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"></pre></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">Exemplo dun algoritmo (WinPseudo 1.4) que imprime todos os n\u00fameros menores que <Limite>:</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"><pre></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">#-----------------------------------------</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">#\u00a0 Pseudoc\u00f3digo para imprimir todos os </ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">#\u00a0 n\u00fameros menores que <Limite>\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 </ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">#-----------------------------------------</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">INICIO Programa1 - Imprime todos os n\u00fameros menores que <Limite></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 VAR</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\tNUMERICO i</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\tNUMERICO Limite</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 FIN-VAR</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 LER (Limite)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 IMPRIMIR NL</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 i = 0</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 MENTRES (i < Limite)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\tIMPRIMIR ENTEIRO (i)</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\tIMPRIMIR \", \"</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\ti = i + 1</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">\u00a0 \u00a0 FIN-MENTRES</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">FINAL</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\"></pre></ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== Notas ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">{{Listaref|30em}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">== V\u00e9xase tam\u00e9n ==</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">{{Commonscat}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">=== Bibliograf\u00eda ===</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|last=Bellah |first=Robert Neelly |year=1985 |authorlink=Robert N. Bellah |title=Habits of the Heart: Individualism and Commitment in American Life |location=Berkeley |isbn=978-0-520-25419-0 |publisher=University of California Press |url=https://books.google.com/books?id=XsUojihVZQcC |ref=harv}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|last=Berlinski |first=David |title=The Advent of the Algorithm: The 300-Year Journey from an Idea to the Computer |year=2001 |publisher=Harvest Books |isbn=978-0-15-601391-8 |url=https://archive.org/details/adventofalgorith0000berl }}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|last=Chabert |first=Jean-Luc |title=A History of Algorithms: From the Pebble to the Microchip |url=https://archive.org/details/isbn_0116404090940 |year=1999 |publisher=Springer Verlag |isbn=978-3-540-63369-3}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|nome1=Thomas H.|apelidos1= Cormen |nome2=Charles E.|apelidos2= Leiserson |nome3=Ronald L.|apelidos3= Rivest |nome4=Clifford|apelidos4=Stein |title=Introduction To Algorithms |edition=3rd |year=2009 |publisher=MIT Press |isbn=978-0-262-03384-8}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|author=Harel, David |author2=Feldman, Yishai |title=Algorithmics: The Spirit of Computing |year=2004 |publisher=Addison-Wesley |isbn=978-0-321-11784-7}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|last1=Hertzke |first1=Allen D. |last2=McRorie |first2=Chris |year=1998 |editor1-last=Lawler |editor1-first=Peter Augustine |editor2-last=McConkey |editor2-first=Dale |chapter=The Concept of Moral Ecology |title=Community and Political Thought Today |location=Westport, CT |publisher=[[Praeger Publishers|Praeger]</ins>] <ins class=\"diffchange diffchange-inline\">|ref=harv}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>* [<ins class=\"diffchange diffchange-inline\">[Donald Knuth|Knuth, Donald E.]] (2000). ''[http://www-cs-faculty.stanford.edu/~uno/aa.html Selected Papers on Analysis of Algorithms] {{Webarchive|url=</ins>https<ins class=\"diffchange diffchange-inline\">://web.archive.org/web/20170701190647/http</ins>://www<ins class=\"diffchange diffchange-inline\">-cs-faculty</ins>.<ins class=\"diffchange diffchange-inline\">stanford.edu/~uno/aa.html |date=01 de xullo de 2017 }}''. Stanford, California: Center for the Study of Language and Information.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* Knuth, Donald E. (2010). ''[http://www-cs-faculty.stanford.edu/~uno/da.html Selected Papers on Design of Algorithms] {{Webarchive|url=https://web.archive</ins>.org/<ins class=\"diffchange diffchange-inline\">web</ins>/<ins class=\"diffchange diffchange-inline\">20170716225848/http</ins>:/<ins class=\"diffchange diffchange-inline\">/www-cs-faculty.stanford.edu/~uno/da.html |date=16 de xullo de 2017 }}''. Stanford, California: Center for the Study of Language and Information.</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* {{cita libro|first1=Wendell |last1=Wallach |first2=Colin |last2=Allen |date=November 2008 |title=Moral Machines</ins>: <ins class=\"diffchange diffchange-inline\">Teaching Robots Right from Wrong |isbn=978-0-19-537404-9 |publisher=Oxford University Press |location=US |ref=harv}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">=== Outros artigos ===</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* [[Algoritmo xen\u00e9tico]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* [[Ciencia da Computaci\u00f3n]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* [[Estruturas de datos]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* [[Exemplos de algoritmos en varias linguaxes]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">=== Ligaz\u00f3ns externas ===</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* [http://www.myalgorithm.com Exemplos de algoritmos b\u00e1sicos]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">* [http://www.algoritmos.tk Todo sobre algoritmos] {{Webarchive|url=https://web.archive.org/web/20200503000718/http://www.algoritmos.tk/ |date=03 de maio de 2020 }}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">{{Control de autoridades}}</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div>\u00a0</div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">[[Categor\u00eda:Algoritmos]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">[[Categor\u00eda:Enxe\u00f1ar\u00eda de software]]</ins></div></td></tr>\n<tr><td colspan=\"2\" class=\"diff-side-deleted\"></td><td class=\"diff-marker\" data-marker=\"+\"></td><td class=\"diff-addedline diff-side-added\"><div><ins class=\"diffchange diffchange-inline\">[[Categor\u00eda:Artigos que toda Wikipedia deber\u00eda ter (Tecnolox\u00eda)]</ins>]</div></td></tr>\n"
}
}