{"id":680,"date":"2007-07-05T23:06:42","date_gmt":"2007-07-05T21:06:42","guid":{"rendered":"http:\/\/bitacora.eniac2000.com\/?p=680"},"modified":"2007-07-05T23:06:42","modified_gmt":"2007-07-05T21:06:42","slug":"representacion-grafica-de-los-principales-algoritmos-de-ordenacion","status":"publish","type":"post","link":"https:\/\/bitacora.eniac2000.com\/?p=680","title":{"rendered":"Representaci\u00f3n gr\u00e1fica de los principales algoritmos de ordenaci\u00f3n"},"content":{"rendered":"<p>Hubiera matado, en mis tiempos de Metodolog\u00eda de la Programaci\u00f3n I y II con <em>Herr<\/em> <a href=\"http:\/\/www.uco.es\/~ma1fegan\/\">Nikolai<\/a>, por haber tenido a mano algo como lo que he visto en <a href=\"http:\/\/microsiervos.com\">Microsiervos<\/a>: <a href=\"http:\/\/cg.scs.carleton.ca\/~morin\/misc\/sortalg\/\">Sorting Algorithms<\/a>.<\/p>\n<p>Es una p\u00e1gina que con unos applets te permite ver el tiempo que los diferentes algoritmos que se estudian en las primeras asignaturas de la carrera tardan en realizar ordenaciones, as\u00ed como realizar comparativas entre ellos. Y por si todo ello fuera poco, te ofrencen, adem\u00e1s, el c\u00f3digo fuente en Java de dichos algoritmos.<\/p>\n<p>Ah\u00ed estan nuestros viejos conocidos <a href=\"http:\/\/cg.scs.carleton.ca\/~morin\/misc\/sortalg\/QSortAlgorithm.java\">QuickSort<\/a>, o el <a href=\"http:\/\/cg.scs.carleton.ca\/~morin\/misc\/sortalg\/BubbleSortAlgorithm.java\">m\u00e9todo de la burbuja<\/a> o del <a href=\"http:\/\/cg.scs.carleton.ca\/~morin\/misc\/sortalg\/HeapSortAlgorithm.java\">mont\u00edculo<\/a>, y dos de los que no ten\u00eda conocimiento de su existencia: <a href=\"http:\/\/cg.scs.carleton.ca\/~morin\/misc\/sortalg\/JSortAlgorithm.java\">JSort<\/a> y <a href=\"http:\/\/cg.scs.carleton.ca\/~morin\/misc\/sortalg\/MergeSortAlgorithm.java\">MergeSort<\/a> que, nunca lo hubiera cre\u00eddo, son significativamente m\u00e1s r\u00e1pidos que mi <em>querido<\/em> QuickSort.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hubiera matado, en mis tiempos de Metodolog\u00eda de la Programaci\u00f3n<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[13],"tags":[],"series":[],"class_list":["post-680","post","type-post","status-publish","format-standard","hentry","category-informatica"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=\/wp\/v2\/posts\/680","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=680"}],"version-history":[{"count":0,"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=\/wp\/v2\/posts\/680\/revisions"}],"wp:attachment":[{"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=680"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=680"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=680"},{"taxonomy":"series","embeddable":true,"href":"https:\/\/bitacora.eniac2000.com\/index.php?rest_route=%2Fwp%2Fv2%2Fseries&post=680"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}