{"id":19662509,"url":"https://github.com/cgrade/sorting_algorithms","last_synced_at":"2025-02-27T03:21:30.119Z","repository":{"id":106035124,"uuid":"595460102","full_name":"cgrade/sorting_algorithms","owner":"cgrade","description":"What is the Big O notation, and how to evaluate the time complexity of an algorithm How to select the best sorting algorithm for a given input What is a stable sorting algorithm","archived":false,"fork":false,"pushed_at":"2023-01-31T05:50:29.000Z","size":8,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-10T01:52:19.739Z","etag":null,"topics":[],"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/cgrade.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-31T05:45:16.000Z","updated_at":"2023-01-31T05:49:20.000Z","dependencies_parsed_at":null,"dependency_job_id":"df3470ba-966f-4ea4-a120-52d41f362f66","html_url":"https://github.com/cgrade/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/cgrade%2Fsorting_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cgrade%2Fsorting_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cgrade%2Fsorting_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cgrade%2Fsorting_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/cgrade","download_url":"https://codeload.github.com/cgrade/sorting_algorithms/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240971273,"owners_count":19886716,"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-11-11T16:11:37.881Z","updated_at":"2025-02-27T03:21:30.088Z","avatar_url":"https://github.com/cgrade.png","language":"C","readme":"## 0x1B. C - Sorting algorithms \u0026 Big O\r\n\r\n## All Tasks\r\n\r\n** Task 0. Bubble sort\r\nWrite a function that sorts an array of integers in ascending order using the Bubble sort algorithm\r\n\r\n** Task 1. Insertion sort\r\nWrite a function that sorts a doubly linked list of integers in ascending order using the Insertion sort algorithm\r\n\r\n** Task 2. Selection sort\r\nWrite a function that sorts an array of integers in ascending order using the Selection sort algorithm\r\n\r\n** Task 3. Quick sort\r\nWrite a function that sorts an array of integers in ascending order using the Quick sort algorithm\r\n\r\n** Task 4. Shell sort - Knuth Sequence\r\nWrite a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence\r\n\r\n** Task 5. Cocktail shaker sort\r\nWrite a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm\r\n\r\n** Task 6. Counting sort\r\nWrite a function that sorts an array of integers in ascending order using the Counting sort algorithm\r\n\r\n** Task 7. Merge sort\r\nWrite a function that sorts an array of integers in ascending order using the Merge sort algorithm\r\n\r\n** Task 8. Heap sort\r\nWrite a function that sorts an array of integers in ascending order using the Heap sort algorithm\r\n\r\n** Task 9. Radix sort\r\nWrite a function that sorts an array of integers in ascending order using the Radix sort algorithm\r\n\r\n**Task 10. Bitonic sort\r\nWrite a function that sorts an array of integers in ascending order using the Bitonic sort algorithm\r\n\r\n** Task 11. Quick Sort - Hoare Partition scheme\r\nWrite a function that sorts an array of integers in ascending order using the Quick sort algorithm\r\n\r\n **Task 12: Dealer; Write a function that sorts a deck of cards.\r\n\r\n** Author: Abraham Elijah\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcgrade%2Fsorting_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcgrade%2Fsorting_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcgrade%2Fsorting_algorithms/lists"}