{"id":693,"date":"2014-12-31T23:21:23","date_gmt":"2014-12-31T22:21:23","guid":{"rendered":"http:\/\/www.valcon.it\/pascal\/?p=693"},"modified":"2015-07-03T12:48:22","modified_gmt":"2015-07-03T10:48:22","slug":"quick-sort","status":"publish","type":"post","link":"https:\/\/www.valcon.it\/pascal\/quick-sort\/","title":{"rendered":"Quick sort"},"content":{"rendered":"<p>Un algoritmo di ordinamento<\/p>\n<ul>\n<li>molto complicato: <em>ricorsivo e difficile da ricordare<\/em><\/li>\n<li>ma ottimo: <em>\u00e8 quasi sempre molto veloce&#8230;<\/em><\/li>\n<\/ul>\n<pre class=\"\">Procedure QUICKSORT(var V: Vettore; Inf, Sup: Integer);\r\nVar\r\n \u00a0 i, j: Integer;\r\n \u00a0 Perno: Elemento;\r\nBegin1\r\n \u00a0 If(Inf < Sup) Then\r\n\u00a0 \u00a0 \u00a0 Begin\r\n \u00a0 \u00a0 \u00a0 \u00a0 i:=Inf;\r\n \u00a0 \u00a0 \u00a0 \u00a0 j:=Sup;\r\n \u00a0 \u00a0 \u00a0 \u00a0 Perno:=V[(Inf+Sup) DIV 2];\r\n \u00a0 \u00a0 \u00a0 \u00a0 Repeat\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 While(V[i] < Perno) Do\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Inc(i);\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 While(Perno < V[j]) Do\r\n \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Dec(j);\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 If(i <= j) then\r\n \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Begin\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 SCAMBIA(V[i], V[j]);\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Inc(i);\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Dec(j);\r\n \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 End;\r\n\u00a0 \u00a0 \u00a0 \u00a0  Until(I > J);\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0QUICKSORT(V, Inf, j);\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0QUICKSORT(V, i, Sup);\r\n\u00a0 \u00a0   End;\r\nEnd;<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Un algoritmo di ordinamento molto complicato: ricorsivo e difficile da ricordare ma ottimo: \u00e8 quasi sempre molto veloce&#8230; Procedure QUICKSORT(var V: Vettore; Inf, Sup: Integer); Var \u00a0 i, j: Integer; \u00a0 Perno: Elemento; Begin1 \u00a0 If(Inf < Sup) Then \u00a0 \u00a0 \u00a0 Begin \u00a0 \u00a0 \u00a0 \u00a0 i:=Inf; \u00a0 \u00a0 \u00a0 \u00a0 j:=Sup; \u00a0 \u00a0 ... <a title=\"Quick sort\" class=\"read-more\" href=\"https:\/\/www.valcon.it\/pascal\/quick-sort\/\" aria-label=\"Leggi di pi\u00f9 su Quick sort\">Leggi tutto<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[10],"tags":[],"_links":{"self":[{"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/posts\/693"}],"collection":[{"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/comments?post=693"}],"version-history":[{"count":3,"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/posts\/693\/revisions"}],"predecessor-version":[{"id":696,"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/posts\/693\/revisions\/696"}],"wp:attachment":[{"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/media?parent=693"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/categories?post=693"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.valcon.it\/pascal\/wp-json\/wp\/v2\/tags?post=693"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}