{"id":22369652,"url":"https://github.com/saddickq/sorting_algorithms","last_synced_at":"2025-03-26T16:23:40.328Z","repository":{"id":183247677,"uuid":"669822315","full_name":"Saddickq/sorting_algorithms","owner":"Saddickq","description":"contains code for different sorting algorithms in C","archived":false,"fork":false,"pushed_at":"2023-07-30T17:44:37.000Z","size":22,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-31T19:35:36.149Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Saddickq.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,"governance":null,"roadmap":null,"authors":"AUTHORS","dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-07-23T14:42:46.000Z","updated_at":"2024-07-18T13:56:17.000Z","dependencies_parsed_at":null,"dependency_job_id":"0ec0af68-7b19-4910-8ef8-6046005cab65","html_url":"https://github.com/Saddickq/sorting_algorithms","commit_stats":null,"previous_names":["saddickq/sorting_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saddickq%2Fsorting_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saddickq%2Fsorting_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saddickq%2Fsorting_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saddickq%2Fsorting_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Saddickq","download_url":"https://codeload.github.com/Saddickq/sorting_algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245690002,"owners_count":20656509,"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":[],"created_at":"2024-12-04T19:27:15.151Z","updated_at":"2025-03-26T16:23:40.306Z","avatar_url":"https://github.com/Saddickq.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"**0x1B. C - Sorting algorithms \u0026 Big O**\n\nThis repository contains code in C that illustrates some sorting algorithms\nExamples of those algorithms are;\n1. Bubble sort algorithm\n2. Inserion sort algorithm\n3. Selection sort algorithm\n4. Quick sort algorithm\n5. Merge sort algorithm\n...\n\nThis project also covers the time conplexities of these sorting algorithms.\nTime complexities are:\n1. O(1)\n2. O(n)\n3. O(n!)\n4. n square -\u003e O(n^2)\n5. log(n) -\u003e O(log(n))\n6. n * log(n) -\u003e O(nlog(n))\n7. n + k -\u003e O(n+k)\n...\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsaddickq%2Fsorting_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsaddickq%2Fsorting_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsaddickq%2Fsorting_algorithms/lists"}