{"id":16402931,"url":"https://github.com/bm777/tri_insertion","last_synced_at":"2025-02-23T16:13:19.608Z","repository":{"id":107403586,"uuid":"160743337","full_name":"bm777/Tri_insertion","owner":"bm777","description":"En informatique, le tri par insertion est un algorithme de tri classique. La plupart des personnes l'utilisent naturellement pour trier des cartes à jouer.","archived":false,"fork":false,"pushed_at":"2018-12-06T23:03:47.000Z","size":27,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-05T05:24:42.843Z","etag":null,"topics":["insertion","rapide"],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bm777.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-12-06T23:02:29.000Z","updated_at":"2018-12-17T00:01:54.000Z","dependencies_parsed_at":"2023-03-13T14:36:28.137Z","dependency_job_id":null,"html_url":"https://github.com/bm777/Tri_insertion","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bm777%2FTri_insertion","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bm777%2FTri_insertion/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bm777%2FTri_insertion/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bm777%2FTri_insertion/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bm777","download_url":"https://codeload.github.com/bm777/Tri_insertion/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240339583,"owners_count":19785957,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["insertion","rapide"],"created_at":"2024-10-11T05:47:40.439Z","updated_at":"2025-02-23T16:13:19.601Z","avatar_url":"https://github.com/bm777.png","language":"C","readme":"# __Tri à Insertion__\nEn général, le tri par insertion est beaucoup plus lent que d'autres algorithmes comme le tri rapide (ou quicksort) et le tri fusion pour traiter de grandes séquences, car sa complexité asymptotique est quadratique.\n\nLe tri par insertion est cependant considéré comme le tri le plus efficace sur des entrées de petite taille. Il est aussi très rapide lorsque les données sont déjà presque triées. Pour ces raisons, il est utilisé en pratique en combinaison avec d'autres méthodes comme le tri rapide.\n\nLe tri par insertion possède également l'avantage de faire uniquement N permutations. Cela est intéressant sur un périphérique où le déplacement est coûteux en temps.\n# Exemple du tri par insertion utilisant une liste de nombres aléatoires\n![alt text](https://upload.wikimedia.org/wikipedia/commons/2/25/Insertion_sort_animation.gif?uselang=fr)\n\n# Illustration graphique du tri par insertion.\n![alt text](https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif?uselang=fr)\n\n# Initialisation des valeurs\n![Alt text](img/1.png?raw=true \"init\")\n\n# Résultat\n![Alt text](img/2.png?raw=true \"Resultat\")\n\n# Auteur : Bayangmbe Mounmo (bm7)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbm777%2Ftri_insertion","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbm777%2Ftri_insertion","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbm777%2Ftri_insertion/lists"}