{"id":19619258,"url":"https://github.com/justehmadsaeed/algorithm-analysis","last_synced_at":"2026-05-27T16:31:12.314Z","repository":{"id":124210940,"uuid":"238439485","full_name":"justEhmadSaeed/Algorithm-Analysis","owner":"justEhmadSaeed","description":"Algorithm Analysis of Insertion sort, Merge sort and Hybrid sort","archived":false,"fork":false,"pushed_at":"2020-02-05T17:20:05.000Z","size":5,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-26T18:34:07.717Z","etag":null,"topics":["algorithm-analysis","algorithm-challenges","complexity","hybrid","insertion-algorithms","insertion-sort","merge-sort","mergesort-algorithm"],"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/justEhmadSaeed.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":"2020-02-05T11:58:17.000Z","updated_at":"2021-06-28T03:20:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"15544036-0fae-4063-ae7c-e74f1fb99014","html_url":"https://github.com/justEhmadSaeed/Algorithm-Analysis","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/justEhmadSaeed/Algorithm-Analysis","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FAlgorithm-Analysis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FAlgorithm-Analysis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FAlgorithm-Analysis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FAlgorithm-Analysis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/justEhmadSaeed","download_url":"https://codeload.github.com/justEhmadSaeed/Algorithm-Analysis/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/justEhmadSaeed%2FAlgorithm-Analysis/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33575510,"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-05-27T02:00:06.184Z","response_time":53,"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":["algorithm-analysis","algorithm-challenges","complexity","hybrid","insertion-algorithms","insertion-sort","merge-sort","mergesort-algorithm"],"created_at":"2024-11-11T11:12:56.872Z","updated_at":"2026-05-27T16:31:12.309Z","avatar_url":"https://github.com/justEhmadSaeed.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithm Analysis\n\n## Insertion Sort\n\n-   Takes n^2 time complexity to sort the Array\n-   Better for small sized arrays\n\n## Merge Sort\n\n-   Takes n(ln(n)) time complexity to sort the Array\n-   Better for large sized arrays\n\n## Hybrid Merge Sort\n\n-   Hybrid version of Merge and Insertion sort algorithm to provide better results and time complexity\n-   Sorts large sized arrays by **Merge Sort** until **Insertion Sort** Algorithm becomes more efficient and sorts the remaining small sized arrays by insertion sort algorithm\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjustehmadsaeed%2Falgorithm-analysis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjustehmadsaeed%2Falgorithm-analysis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjustehmadsaeed%2Falgorithm-analysis/lists"}