{"id":23095325,"url":"https://github.com/micahondiwa/sorting_algorithms","last_synced_at":"2025-04-03T19:27:02.587Z","repository":{"id":103549822,"uuid":"592659375","full_name":"micahondiwa/sorting_algorithms","owner":"micahondiwa","description":"Implementing different sorting algorithms in C. ","archived":false,"fork":false,"pushed_at":"2023-03-02T21:49:14.000Z","size":26,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-09T07:35:42.803Z","etag":null,"topics":["algorithm","algorithms","sort","sorting","sorting-algorithms"],"latest_commit_sha":null,"homepage":"https://github.com/micahondiwa/sorting_algorithms","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/micahondiwa.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":"2023-01-24T08:38:10.000Z","updated_at":"2023-05-01T03:19:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"6c129016-630d-4b87-8c49-57286148bf33","html_url":"https://github.com/micahondiwa/sorting_algorithms","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/micahondiwa%2Fsorting_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/micahondiwa%2Fsorting_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/micahondiwa%2Fsorting_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/micahondiwa%2Fsorting_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/micahondiwa","download_url":"https://codeload.github.com/micahondiwa/sorting_algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247064163,"owners_count":20877559,"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":["algorithm","algorithms","sort","sorting","sorting-algorithms"],"created_at":"2024-12-16T22:21:55.553Z","updated_at":"2025-04-03T19:27:02.582Z","avatar_url":"https://github.com/micahondiwa.png","language":"C","readme":"C - Sorting algorithms \u0026 Big O\n\n- A project during my Full Stack Software Engineering studies at [ALX Africa](https://www.alxafrica.com/software-engineering-2022/), a course offered by [Holberton School](https://www.holbertonschool.com/).\n\n## Technologies \n- Files written in ```vi```, ```vim,``` and ```emacs``` editors. \n- C files compiled using ```gcc 9.4.0```.\n- C files wriiten according to the betty coding style. Checked using [betty-style.pl](https://github.com/holbertonschool/Betty/blob/master/betty-style.pl) and [betty-doc.pl](https://github.com/holbertonschool/Betty/blob/master/betty-doc.pl).\n- Files tested on ```Ubuntu 20.04``` LTS using ```gcc```.\n\n## Files \n\n| Filename  | Description |\n| ---  | --- |\n|[0-bubble_sort.c](0-bubble_sort.c)|Write a function that sorts an array of integers in ascending order using the [Bubble sort](https://intranet.alxswe.com/rltoken/awhP8BhtkGi-lwmMc2-KAw) algorithm|\n|[1-insertion_sort_list.c](1-insertion_sort_list.c)|Write a function that sorts a doubly linked list of integers in ascending order using the [Insertion sort](https://intranet.alxswe.com/rltoken/GocxRKbPdsmERXeOHMCO2w) algorithm.|\n|[2-selection_sort.c](2-selection_sort.c)|Write a function that sorts an array of integers in ascending order using the [Selection sort](https://intranet.alxswe.com/rltoken/SEbg0fBEraioQcl-igvUSw) algorithm.|\n|[3-quick_sort.c](3-quick_sort.c)|Write a function that sorts an array of integers in ascending order using the [Quick sort](https://intranet.alxswe.com/rltoken/_pBTrH0Xyo4BRmQn4CtnMg) algorithm.|\n|[100-shell_sort.c](100-shell_sort.c)|Write a function that sorts an array of integers in ascending order using the [Shell sort algorithm](https://intranet.alxswe.com/rltoken/FdpP4Qin3iDAaz1kuPD2Kg), using the ```Knuth sequence```|\n|[101-cocktail_sort_list.c](101-cocktail_sort_list.c)|Write a function that sorts a doubly linked list of integers in ascending order using the [Cocktail shaker sort](https://intranet.alxswe.com/rltoken/bwa4mHfUbbWTB8J2OIHvpA) algorithm.|\n|[102-counting_sort.c](102-counting_sort.c)|Write a function that sorts an array of integers in ascending order using the [Counting sort](https://intranet.alxswe.com/rltoken/ChcoDSCqnJHGC-qrSPEGHQ) algorithm.|\n|[103-merge_sort.c](103-merge_sort.c)|Write a function that sorts an array of integers in ascending order using the [Merge sort](https://intranet.alxswe.com/rltoken/8sZ3nAhd_YLNzHCgNbbf8A) algorithm.|\n|[104-heap_sort.c](104-heap_sort.c)|Write a function that sorts an array of integers in ascending order using the [Heap sort](https://intranet.alxswe.com/rltoken/YKYRdSdomaVkNrtNv1KS6Q) algorithm.|\n|[105-radix_sort.c](105-radix_sort.c)|Write a function that sorts an array of integers in ascending order using the [Radix sort](https://intranet.alxswe.com/rltoken/pBsj4j_AF_mJAgNZWmX3VQ) algorithm|\n|[106-bitonic_sort.c](106-bitonic_sort.c)|Write a function that sorts an array of integers in ascending order using the [Bitonic sort](https://intranet.alxswe.com/rltoken/N-bjAbxm5yr4DoeIDz5lLw) algorithm|\n\n\n### Other Files\n```* -O``` Files : The big ```O``` notations of the time complexity of the each algorithm, with 1 notation per line:\n- 1. in the best case\n- 2. in the average case\n- 3. in the worst case\n\n\nThe formats: \n- ```O(1)```\n- ```O(n)```\n- ```O(n!)```\n- n square -\u003e ```O(n^2)```\n- log(n) -\u003e ```O(log(n))```\n- n * log(n) -\u003e ```O(nlog(n))```\n- n + k -\u003e ```O(n+k)```\n- …\n\n\n\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmicahondiwa%2Fsorting_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmicahondiwa%2Fsorting_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmicahondiwa%2Fsorting_algorithms/lists"}