{"id":19538571,"url":"https://github.com/anilerc/experimental-analysis-sorting-algorithms","last_synced_at":"2026-06-11T02:31:14.105Z","repository":{"id":136572004,"uuid":"436017290","full_name":"anilerc/experimental-analysis-sorting-algorithms","owner":"anilerc","description":"This project aims to conduct an experiment and evaluate the time complexity metrics of the following sorting algorithms for each different input characteristic.  ","archived":false,"fork":false,"pushed_at":"2023-11-04T23:00:13.000Z","size":2371,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-26T04:41:25.244Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/anilerc.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}},"created_at":"2021-12-07T20:28:55.000Z","updated_at":"2021-12-07T20:38:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"b071fd17-f874-448a-93f8-99f698843309","html_url":"https://github.com/anilerc/experimental-analysis-sorting-algorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anilerc/experimental-analysis-sorting-algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anilerc%2Fexperimental-analysis-sorting-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anilerc%2Fexperimental-analysis-sorting-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anilerc%2Fexperimental-analysis-sorting-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anilerc%2Fexperimental-analysis-sorting-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anilerc","download_url":"https://codeload.github.com/anilerc/experimental-analysis-sorting-algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anilerc%2Fexperimental-analysis-sorting-algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34180147,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-11T02:00:06.485Z","response_time":57,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":[],"created_at":"2024-11-11T02:35:36.360Z","updated_at":"2026-06-11T02:31:14.080Z","avatar_url":"https://github.com/anilerc.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# experimental-evaluation-sort-algos\nThis project aims to conduct an experiment and evaluate the time complexity metrics of the following sorting algorithms for each different input characteristic.\n\nThere are five different input characterisitics:\n\nSorted,\nReverse sorted,\nAlmost sorted,\nDuplicate,\nRandom.\n\nThe following sorting techniques are coded by us before the experiment:\n\nInsertion Sort\n\nBinary Insertion Sort\n\nMerge Sort\n\nQuick Sort\n\nQuick Sort with Median of 3 Optimization\n\nHeap Sort\n\nCounting Sort\n\n\nThen, for each algorithm, data sets representing each input characteristic were run. \nFinally, their sorting performance and relative comparison for each combination were meticulously investigated by us in the project report.\n\nPLEASE VISIT REPORT \u0026 EVALUATION.PDF file for further info.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanilerc%2Fexperimental-analysis-sorting-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanilerc%2Fexperimental-analysis-sorting-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanilerc%2Fexperimental-analysis-sorting-algorithms/lists"}