{"id":26400944,"url":"https://github.com/helogizzy/mergesort_supermerge_comparation","last_synced_at":"2025-06-27T19:35:38.816Z","repository":{"id":221751403,"uuid":"755257746","full_name":"Helogizzy/MergeSort_SuperMerge_Comparation","owner":"Helogizzy","description":null,"archived":false,"fork":false,"pushed_at":"2024-02-09T20:11:04.000Z","size":16153,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-17T14:46:40.391Z","etag":null,"topics":["analysis-algorithms","merge","mergesort","supermerge"],"latest_commit_sha":null,"homepage":"","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/Helogizzy.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}},"created_at":"2024-02-09T18:52:48.000Z","updated_at":"2024-02-28T18:07:26.000Z","dependencies_parsed_at":"2024-02-09T21:35:39.779Z","dependency_job_id":null,"html_url":"https://github.com/Helogizzy/MergeSort_SuperMerge_Comparation","commit_stats":null,"previous_names":["helogizzy/mergesort_supermerge_comparation"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Helogizzy/MergeSort_SuperMerge_Comparation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Helogizzy%2FMergeSort_SuperMerge_Comparation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Helogizzy%2FMergeSort_SuperMerge_Comparation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Helogizzy%2FMergeSort_SuperMerge_Comparation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Helogizzy%2FMergeSort_SuperMerge_Comparation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Helogizzy","download_url":"https://codeload.github.com/Helogizzy/MergeSort_SuperMerge_Comparation/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Helogizzy%2FMergeSort_SuperMerge_Comparation/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262319549,"owners_count":23293044,"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":["analysis-algorithms","merge","mergesort","supermerge"],"created_at":"2025-03-17T14:38:15.831Z","updated_at":"2025-06-27T19:35:38.749Z","avatar_url":"https://github.com/Helogizzy.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MergeSort_SuperMerge_Comparation\n\u003eColaboradores: [Eduarda Elger](https://github.com/EduardaElger), [Ellen Bonafin](https://github.com/EllenBonafin) e [Heloisa Alves](https://github.com/Helogizzy)\n\n## Sobre\nTrabalho de Projeto e Análise de Algortimos com a finalidade de avaliar o comportamento dos métodos MergeSort e SuperMerge perante conjuntos de testes com diferentes características. Durante a execuçãoo dos testes o critério de análise será o tempo cronológico gasto para a execução dos métodos.\n\n### MergeSort\nConsiste no Merge clássico em que cada iteração o probema é divido ao meio e duas novas instâncias do problema são chamadas.\n\n### SuperMerge\nNesta abordagem o poblema será dividido em quatro subpartes e para cada uma é então executada um nova chamada recursiva.\n\n## Testes\nPara a realização dos testes foi feita a leitura dos vetores de entrada. Essa leitura é feita através de quatro arquivos diferentes, sendo eles: vetores aleatórios, decrescentes, crescentes e parcialmente ordenados.\n\nA fim de avaliar o impacto no tempo de processamento dos algoritmos de ordenação, cada um dos tipos de arquivos recebeu testes com vetores de tamanho: 100, 200, 500, 1000, 2000, 5000, 7500, 10000, 15000, 30000, 50000, 75000, 100000, 200000, 500000, 750000, 1000000, 1250000, 1500000 e 2000000.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhelogizzy%2Fmergesort_supermerge_comparation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhelogizzy%2Fmergesort_supermerge_comparation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhelogizzy%2Fmergesort_supermerge_comparation/lists"}