{"id":16652669,"url":"https://github.com/gabrielczar/ordenacao","last_synced_at":"2025-07-14T03:39:00.760Z","repository":{"id":89620584,"uuid":"65155124","full_name":"GabrielCzar/Ordenacao","owner":"GabrielCzar","description":"Implementações de métodos de ordenação","archived":false,"fork":false,"pushed_at":"2016-08-07T21:36:42.000Z","size":7,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-01-19T09:41:43.514Z","etag":null,"topics":["algorithms","bubble-sort","bucket-sort","c-plus-plus","mergesort-algorithm","qtcreator","quicksort-algorithm","sfml"],"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/GabrielCzar.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":"2016-08-07T21:35:50.000Z","updated_at":"2017-02-15T01:16:31.000Z","dependencies_parsed_at":null,"dependency_job_id":"f9ada6c2-416b-4f3b-8e50-a98d65f455f0","html_url":"https://github.com/GabrielCzar/Ordenacao","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/GabrielCzar%2FOrdenacao","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabrielCzar%2FOrdenacao/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabrielCzar%2FOrdenacao/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GabrielCzar%2FOrdenacao/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GabrielCzar","download_url":"https://codeload.github.com/GabrielCzar/Ordenacao/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243251572,"owners_count":20261238,"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":["algorithms","bubble-sort","bucket-sort","c-plus-plus","mergesort-algorithm","qtcreator","quicksort-algorithm","sfml"],"created_at":"2024-10-12T09:29:19.177Z","updated_at":"2025-03-12T16:28:36.812Z","avatar_url":"https://github.com/GabrielCzar.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n# Atividades do módulo.\n\n1. Implementar um embaralhador de vetor\n2. Criar um vetor crescente e shuffle\n3. Implementar o minimum de forma que em cada laco ele encontre o minimo e o maximo.\n4. Implementar o bubble sort\n5. Implementar o quick sort\n6. Implementar o merge sort\n7. Implementar o bucket sort\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgabrielczar%2Fordenacao","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgabrielczar%2Fordenacao","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgabrielczar%2Fordenacao/lists"}