{"id":3337,"date":"2022-07-29T11:07:42","date_gmt":"2022-07-29T08:07:42","guid":{"rendered":"https:\/\/demensdeum.com\/blog\/?p=3337"},"modified":"2024-12-16T22:32:18","modified_gmt":"2024-12-16T19:32:18","slug":"binary-insertion-sort","status":"publish","type":"post","link":"https:\/\/demensdeum.com\/blog\/pt\/2022\/07\/29\/binary-insertion-sort\/","title":{"rendered":"Classifica\u00e7\u00e3o de inser\u00e7\u00e3o bin\u00e1ria"},"content":{"rendered":"<p>A classifica\u00e7\u00e3o por inser\u00e7\u00e3o bin\u00e1ria \u00e9 uma variante da classifica\u00e7\u00e3o por inser\u00e7\u00e3o na qual a posi\u00e7\u00e3o de inser\u00e7\u00e3o \u00e9 determinada usando pesquisa bin\u00e1ria. A complexidade de tempo do algoritmo \u00e9 O(n<sup>2<\/sup>)<\/p>\n<p>O algoritmo funciona assim:<\/p>\n<ol>\n<li>Um loop come\u00e7a de zero at\u00e9 o final da lista<\/li>\n<li>No loop, um n\u00famero \u00e9 selecionado para classifica\u00e7\u00e3o, o n\u00famero \u00e9 armazenado em uma vari\u00e1vel separada<\/li>\n<li>A pesquisa bin\u00e1ria procura o \u00edndice para inserir esse n\u00famero nos n\u00fameros \u00e0 esquerda<\/li>\n<li>Uma vez encontrado o \u00edndice, os n\u00fameros \u00e0 esquerda s\u00e3o deslocados uma posi\u00e7\u00e3o para a direita, come\u00e7ando no \u00edndice de inser\u00e7\u00e3o. No processo, o n\u00famero que precisa ser classificado ser\u00e1 apagado.<\/li>\n<li>O n\u00famero salvo anteriormente \u00e9 inserido no \u00edndice de inser\u00e7\u00e3o<\/li>\n<li>No final do loop, a lista inteira ser\u00e1 classificada<\/li>\n<\/ol>\n<p>Durante uma pesquisa bin\u00e1ria, \u00e9 poss\u00edvel que o n\u00famero n\u00e3o seja encontrado e o \u00edndice n\u00e3o seja retornado. Devido \u00e0 peculiaridade da busca bin\u00e1ria ser\u00e1 encontrado o n\u00famero mais pr\u00f3ximo do buscado, ent\u00e3o para retornar o \u00edndice ser\u00e1 necess\u00e1rio compar\u00e1-lo com o procurado, se o procurado for menor ent\u00e3o o procurado dever\u00e1 estar em o \u00edndice \u00e0 esquerda e, se for maior ou igual, \u00e0 direita.<\/p >\n<p>C\u00f3digo Go:<\/p>\n<div class=\"hcb_wrap\">\n<div class=\"hcb_wrap\">\n<pre class=\"prism line-numbers lang-unknown\" data-lang=\"unknown\"><code>\nimport (\n\t\"fmt\"\n\t\"math\/rand\"\n\t\"time\"\n)\n\nconst numbersCount = 20\nconst maximalNumber = 100\n\nfunc binarySearch(numbers []int, item int, low int, high int) int {\n\tfor high &gt; low {\n\t\tcenter := (low + high) \/ 2\n\t\tif numbers[center] &lt; item { low = center + 1 } else if numbers[center] &gt; item {\n\t\t\thigh = center - 1\n\t\t} else {\n\t\t\treturn center\n\t\t}\n\t}\n\n\tif numbers[low] &lt; item {\n\t\treturn low + 1\n\t} else {\n\t\treturn low\n\t}\n}\n\nfunc main() {\n\trand.Seed(time.Now().Unix())\n\tvar numbers [numbersCount]int\n\tfor i := 0; i &lt; numbersCount; i++ {\n\t\tnumbers[i] = rand.Intn(maximalNumber)\n\t}\n\tfmt.Println(numbers)\n\n\tfor i := 1; i &lt; len(numbers); i++ { searchAreaLastIndex := i - 1 insertNumber := numbers[i] insertIndex := binarySearch(numbers[:], insertNumber, 0, searchAreaLastIndex) for x := searchAreaLastIndex; x &gt;= insertIndex; x-- {\n\t\t\tnumbers[x+1] = numbers[x]\n\t\t}\n\t\tnumbers[insertIndex] = insertNumber\n\t}\n\tfmt.Println(numbers)\n}\n<\/code><\/pre>\n<\/div>\n<\/div>\n<h3>Links<\/h3>\n<p><a href=\"https:\/\/gitlab.com\/demensdeum\/algorithms\/-\/blob\/master\/sortAlgorithms\/binaryInsertionSort\/binaryInsertionSort.go\" target=\"_blank\" rel=\"noopener\">https:\/\/gitlab.com\/demensdeum\/algorithms\/-\/blob\/master\/sortAlgorithms\/binaryInsertionSort\/binaryInsertionSort.go<\/a><\/p>\n<h3>Fontes<\/h3>\n<p><a href=\"https:\/\/www.geeksforgeeks.org\/binary-insertion-sort\/\" target=\"_blank\" rel=\"noopener\">https:\/\/www.geeksforgeeks.org\/binary-insertion- ordenar\/<\/a><br \/><a href=\"https:\/\/www.youtube.com\/watch?v=-OVB5pOZJug\" target=\"_blank\" rel=\"noopener\">https:\/\/www.youtube.com\/watch?v=-OVB5pOZJug<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>A classifica\u00e7\u00e3o por inser\u00e7\u00e3o bin\u00e1ria \u00e9 uma variante da classifica\u00e7\u00e3o por inser\u00e7\u00e3o na qual a posi\u00e7\u00e3o de inser\u00e7\u00e3o \u00e9 determinada usando pesquisa bin\u00e1ria. A complexidade de tempo do algoritmo \u00e9 O(n2) O algoritmo funciona assim: Um loop come\u00e7a de zero at\u00e9 o final da lista No loop, um n\u00famero \u00e9 selecionado para classifica\u00e7\u00e3o, o n\u00famero<a class=\"more-link\" href=\"https:\/\/demensdeum.com\/blog\/pt\/2022\/07\/29\/binary-insertion-sort\/\">Continue reading <span class=\"screen-reader-text\">&#8220;Classifica\u00e7\u00e3o de inser\u00e7\u00e3o bin\u00e1ria&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[61,52],"tags":[131,198,190],"class_list":["post-3337","post","type-post","status-publish","format-standard","hentry","category-techie","category-tutorials","tag-algorithms","tag-binary-insertion-sort","tag-sorting","entry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"pt","enabled_languages":["en","ru","zh","de","fr","ja","pt"],"languages":{"en":{"title":true,"content":true,"excerpt":false},"ru":{"title":true,"content":true,"excerpt":false},"zh":{"title":true,"content":true,"excerpt":false},"de":{"title":true,"content":true,"excerpt":false},"fr":{"title":true,"content":true,"excerpt":false},"ja":{"title":true,"content":true,"excerpt":false},"pt":{"title":true,"content":true,"excerpt":false}}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/3337","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/comments?post=3337"}],"version-history":[{"count":7,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/3337\/revisions"}],"predecessor-version":[{"id":3883,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/posts\/3337\/revisions\/3883"}],"wp:attachment":[{"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/media?parent=3337"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/categories?post=3337"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/pt\/wp-json\/wp\/v2\/tags?post=3337"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}