{"id":17674380,"url":"https://github.com/bernoussama/sorting_algorithms","last_synced_at":"2025-10-14T10:33:32.834Z","repository":{"id":201046711,"uuid":"706830818","full_name":"bernoussama/sorting_algorithms","owner":"bernoussama","description":"Sorting Algorithms","archived":false,"fork":false,"pushed_at":"2023-10-24T19:09:02.000Z","size":71,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-02T19:56:46.684Z","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/bernoussama.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-10-18T17:44:45.000Z","updated_at":"2023-10-18T17:59:57.000Z","dependencies_parsed_at":"2024-10-03T21:19:40.960Z","dependency_job_id":null,"html_url":"https://github.com/bernoussama/sorting_algorithms","commit_stats":null,"previous_names":["0ussamabernou/sorting_algorithms","bernoussama/sorting_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bernoussama/sorting_algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bernoussama%2Fsorting_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bernoussama%2Fsorting_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bernoussama%2Fsorting_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bernoussama%2Fsorting_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bernoussama","download_url":"https://codeload.github.com/bernoussama/sorting_algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bernoussama%2Fsorting_algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279018779,"owners_count":26086452,"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","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"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":[],"created_at":"2024-10-24T07:06:53.573Z","updated_at":"2025-10-14T10:33:32.804Z","avatar_url":"https://github.com/bernoussama.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# sorting_algorithms\n\nSorting Algorithms\n\nData Structure and Functions For this project you are given the following\nprint_array, and print_list functions:\n\n```c\n#include \u003cstdlib.h\u003e\n#include \u003cstdio.h\u003e\n\n/**\n * print_array - Prints an array of integers\n *\n * @array: The array to be printed\n * @size: Number of elements in @array\n */\nvoid print_array(const int *array, size_t size)\n{\n    size_t i;\n\n    i = 0;\n    while (array \u0026\u0026 i \u003c size)\n    {\n        if (i \u003e 0)\n            printf(\", \");\n        printf(\"%d\", array[i]);\n        ++i;\n    }\n    printf(\"\\n\");\n}\n#include \u003cstdio.h\u003e\n#include \"sort.h\"\n\n/**\n * print_list - Prints a list of integers\n *\n * @list: The list to be printed\n */\nvoid print_list(const listint_t *list)\n{\n    int i;\n\n    i = 0;\n    while (list)\n    {\n        if (i \u003e 0)\n            printf(\", \");\n        printf(\"%d\", list-\u003en);\n        ++i;\n        list = list-\u003enext;\n    }\n    printf(\"\\n\");\n}\n```\n\nOur files print_array.c and print_list.c (containing the print_array and\nprint_list functions) will be compiled with your functions during the\ncorrection. Please declare the prototype of the functions print_array and\nprint_list in your sort.h header file Please use the following data structure\nfor doubly linked list:\n\n```c\n/**\n * struct listint_s - Doubly linked list node\n *\n * @n: Integer stored in the node\n * @prev: Pointer to the previous element of the list\n * @next: Pointer to the next element of the list\n */\ntypedef struct listint_s\n{\n    const int n;\n    struct listint_s *prev;\n    struct listint_s *next;\n} listint_t;\n```\n\nPlease, note this format is used for Quiz and Task questions.\n\n```\nO(1)\nO(n)\nO(n!)\nn square -\u003e O(n^2)\nlog(n) -\u003e O(log(n))\nn * log(n) -\u003e O(nlog(n))\nn + k -\u003e O(n+k)\n…\n```\n\nPlease use the “short” notation (don’t use constants). Example: O(nk) or O(wn)\nshould be written O(n). If an answer is required within a file, all your answers\nfiles must have a newline at the end.\n\nTests Here is a quick tip to help you test your sorting algorithms with big sets\nof random integers: Random.org\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbernoussama%2Fsorting_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbernoussama%2Fsorting_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbernoussama%2Fsorting_algorithms/lists"}