{"id":21181307,"url":"https://github.com/daviamsilva/sorts","last_synced_at":"2025-03-14T19:21:11.796Z","repository":{"id":49248386,"uuid":"345837863","full_name":"DaviAMSilva/Sorts","owner":"DaviAMSilva","description":"Coleção de algoritmos de ordenação","archived":false,"fork":false,"pushed_at":"2024-09-19T03:27:28.000Z","size":28,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-21T12:11:42.289Z","etag":null,"topics":["faculdade","sorting-algorithms"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DaviAMSilva.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2021-03-09T00:45:08.000Z","updated_at":"2024-09-19T03:27:31.000Z","dependencies_parsed_at":"2022-09-21T12:23:16.271Z","dependency_job_id":null,"html_url":"https://github.com/DaviAMSilva/Sorts","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/DaviAMSilva%2FSorts","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DaviAMSilva%2FSorts/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DaviAMSilva%2FSorts/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DaviAMSilva%2FSorts/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DaviAMSilva","download_url":"https://codeload.github.com/DaviAMSilva/Sorts/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243632583,"owners_count":20322422,"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":["faculdade","sorting-algorithms"],"created_at":"2024-11-20T17:49:35.402Z","updated_at":"2025-03-14T19:21:11.773Z","avatar_url":"https://github.com/DaviAMSilva.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sorts\n\n**Coleção de algoritmos de ordenação.**\n\nPara as funções de comparação pense que o item de mais *importância* fica no final da lista, e a função deve retornar um número positivo se o primeiro parâmetro é mais *importante* do que o segundo, 0 se forem iguais e um número negativo nos outros casos.\n\n## Ordenações suportadas\n\n- [x] `libbinary_insertion_sort`\n- [x] `libbogo_sort`\n- [x] `libbubble_sort`\n- [x] `libheap_sort`\n- [x] `libinsertion_sort`\n- [x] `libmerge_sort`\n- [x] `libquick_sort`\n- [x] `libradix_sort`\n- [x] `libselection_sort`\n- [x] `libshell_sort`\n\n## Cabeçalhos\n\n```c\nbool binary_insertion_sort(void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool bogo_sort            (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool bubble_sort          (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool heap_sort            (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool insertion_sort       (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool merge_sort           (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool quick_sort           (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool radix_sort           (void *ptr, size_t num, size_t size, size_t buckets, size_t iterations, int (*categorize)(const void *, size_t));\nbool selection_sort       (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\nbool shell_sort           (void *ptr, size_t num, size_t size, int (*compare)(const void *, const void *));\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaviamsilva%2Fsorts","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdaviamsilva%2Fsorts","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdaviamsilva%2Fsorts/lists"}