{"id":23980503,"url":"https://github.com/polymathuniversata/sorting_algorithms","last_synced_at":"2025-06-14T03:05:20.604Z","repository":{"id":224283724,"uuid":"762903659","full_name":"polymathuniversata/sorting_algorithms","owner":"polymathuniversata","description":null,"archived":false,"fork":false,"pushed_at":"2024-02-25T02:27:43.000Z","size":10,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-05-31T22:09:36.025Z","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":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/polymathuniversata.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,"zenodo":null}},"created_at":"2024-02-25T02:26:05.000Z","updated_at":"2024-02-25T02:27:39.000Z","dependencies_parsed_at":null,"dependency_job_id":"a46b2055-d10c-4438-93da-e02482b4efe2","html_url":"https://github.com/polymathuniversata/sorting_algorithms","commit_stats":null,"previous_names":["polymathuniversata/sorting_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/polymathuniversata/sorting_algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fsorting_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fsorting_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fsorting_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fsorting_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/polymathuniversata","download_url":"https://codeload.github.com/polymathuniversata/sorting_algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/polymathuniversata%2Fsorting_algorithms/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259751950,"owners_count":22905966,"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":"2025-01-07T10:15:28.571Z","updated_at":"2025-06-14T03:05:20.598Z","avatar_url":"https://github.com/polymathuniversata.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 0x1B. C - Sorting algorithms \u0026 Big O\n\n## Description\nWhat you should learn from this project:\n\n* At least four different sorting algorithms\n* What is the Big O notation, and how to evaluate the time complexity of an algorithm\n* How to select the best sorting algorithm for a given input\n* What is a stable sorting algorithm\n\n---\n\n### [0. Bubble sort](./0-bubble_sort.c)\n* \n\n\n\n### [1. Insertion sort](./1-insertion_sort_list.c)\n* \n\n\n\n### [2. Selection sort](./2-selection_sort.c)\n* \n\n\n\n### [3. Quick sort](./3-quick_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Quick sort algorithm\n\n\n### [4. Shell sort - Knuth Sequence](./100-shell_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Shell sort algorithm, using the Knuth sequence\n\n\n### [5. Cocktail shaker sort](./101-cocktail_sort_list.c)\n* Write a function that sorts a doubly linked list of integers in ascending order using the Cocktail shaker sort algorithm\n\n\n### [6. Counting sort](./102-counting_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Counting sort algorithm\n\n\n### [7. Merge sort](./103-merge_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Merge sort algorithm\n\n\n### [8. Heap sort](./104-heap_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Heap sort algorithm\n\n\n### [9. Radix sort](./105-radix_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Radix sort algorithm\n\n\n### [10. Bitonic sort](./106-bitonic_sort.c)\n* Write a function that sorts an array of integers in ascending order using the Bitonic sort algorithm\n\n\n### [11. Quick Sort - Hoare Partition scheme](./107-quick_sort_hoare.c)\n* Write a function that sorts an array of integers in ascending order using the Quick sort algorithm\n\n\n### [12. Dealer](./1000-sort_deck.c)\n* \n\n\n---\n\n## Author\n* **Polymath Universata** - [Polymath Universata](https://github.com/polymathuniversata)# sorting_algorithms\n# sorting_algorithms\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpolymathuniversata%2Fsorting_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpolymathuniversata%2Fsorting_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpolymathuniversata%2Fsorting_algorithms/lists"}