Tri Radix \u2013 tri par base. L’algorithme est similaire au tri par comptage dans la mesure o\u00f9 il n’y a pas de comparaison des \u00e9l\u00e9ments\u00a0; \u00e0 la place, les \u00e9l\u00e9ments sont regroup\u00e9s *caract\u00e8re par caract\u00e8re* dans des *buckets* (buckets), le bucket est s\u00e9lectionn\u00e9 par l’index du num\u00e9ro-caract\u00e8re actuel. Complexit\u00e9 temporelle – O(nd).<\/p>\n
Cela fonctionne comme ceci\u00a0:<\/p>\n
Suivant\u00a0:<\/p>\n
Exemple de tri Radix dans Scala\u00a0:<\/p>\n
\nimport scala.util.Random.nextInt\n\n\n\nobject RadixSort {\n\n def main(args: Array[String]) = {\n\n var maxNumber = 200\n\n var numbersCount = 30\n\n var maxLength = maxNumber.toString.length() - 1\n\n\n\n var referenceNumbers = LazyList.continually(nextInt(maxNumber + 1)).take(numbersCount).toList\n\n var numbers = referenceNumbers\n\n \n\n var buckets = List.fill(10)(ListBuffer[Int]())\n\n\n\n for( i <- 0 to maxLength) { numbers.foreach( number => {\n\n var numberString = number.toString\n\n if (numberString.length() > i) {\n\n var index = numberString.length() - i - 1\n\n var character = numberString.charAt(index).toString\n\n var characterInteger = character.toInt \n\n buckets.apply(characterInteger) += number\n\n }\n\n else {\n\n buckets.apply(0) += number\n\n }\n\n }\n\n )\n\n numbers = buckets.flatten\n\n buckets.foreach(x => x.clear())\n\n }\n\n println(referenceNumbers)\n\n println(numbers)\n\n println(s\"Validation result: ${numbers == referenceNumbers.sorted}\")\n\n }\n\n}\n\n<\/code><\/pre>\n<\/div>\n<\/div>\nL’algorithme dispose \u00e9galement d’une version pour une ex\u00e9cution parall\u00e8le, par exemple sur un GPU\u00a0; Il y a aussi une petite option de tri, qui doit \u00eatretr\u00e8s int\u00e9ressante et vraiment \u00e9poustouflante !<\/strong><\/p>\nLiens<\/h3>\n
https:\/\/gitlab .com\/demensdeum\/algorithms\/-\/blob\/master\/sortAlgorithms\/radixSort\/radixSort.scala<\/a><\/p>\nSources<\/h3>\n
https:\/\/ru.wikipedia.org\/wiki\/%D0%9F%D0%BE%D1%80%D0%B0%D0%B7%D1%80%D1%8F%D 0%B4%D0%BD%D0%B0%D1%8F_%D1%81%D0%BE%D1%80%D1%82%D0%B8%D1%80%D0%BE%D0%B2%D0% BA%D0%B0<\/a>
\nhttps:\/\/www.geeksforgeeks.org\/radix-sort\/<\/a><\/p>\nhttps:\/\/www.youtube.com\/watch?v=toAlAJKojos<\/a><\/p>\nhttps:\/\/github.com\/gyatskov\/radix-sort<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"Tri Radix \u2013 tri par base. L’algorithme est similaire au tri par comptage dans la mesure o\u00f9 il n’y a pas de comparaison des \u00e9l\u00e9ments\u00a0; \u00e0 la place, les \u00e9l\u00e9ments sont regroup\u00e9s *caract\u00e8re par caract\u00e8re* dans des *buckets* (buckets), le bucket est s\u00e9lectionn\u00e9 par l’index du num\u00e9ro-caract\u00e8re actuel. Complexit\u00e9 temporelle – O(nd). Cela fonctionne commeContinue reading “Tri par base”<\/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,205,190],"class_list":["post-3394","post","type-post","status-publish","format-standard","hentry","category-techie","category-tutorials","tag-algorithms","tag-radix-sort","tag-sorting","entry"],"translation":{"provider":"WPGlobus","version":"3.0.2","language":"fr","enabled_languages":["en","ru","zh","de","fr","ja","pt","hi"],"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},"hi":{"title":false,"content":false,"excerpt":false}}},"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts\/3394","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/comments?post=3394"}],"version-history":[{"count":8,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts\/3394\/revisions"}],"predecessor-version":[{"id":3864,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/posts\/3394\/revisions\/3864"}],"wp:attachment":[{"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/media?parent=3394"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/categories?post=3394"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/demensdeum.com\/blog\/fr\/wp-json\/wp\/v2\/tags?post=3394"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}