{"id":20245213,"url":"https://github.com/aymenkhs/sorting-algorithms-in-c","last_synced_at":"2026-05-31T01:31:07.865Z","repository":{"id":53759123,"uuid":"344944379","full_name":"aymenkhs/Sorting-algorithms-in-C","owner":"aymenkhs","description":"Implementation and comparison of different sorting techniques in C (Insertion sort, Bubble sort, Quicksort, Merge sort, Heapsort","archived":false,"fork":false,"pushed_at":"2021-07-16T16:10:15.000Z","size":1248,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-14T01:49:19.992Z","etag":null,"topics":["bubble-sort","c","complexity","heapsort","insertion-sort","mergesort","quicksort","sorting-algorithms"],"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/aymenkhs.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}},"created_at":"2021-03-05T21:58:57.000Z","updated_at":"2024-02-08T15:07:25.000Z","dependencies_parsed_at":"2022-09-02T21:02:10.532Z","dependency_job_id":null,"html_url":"https://github.com/aymenkhs/Sorting-algorithms-in-C","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/aymenkhs%2FSorting-algorithms-in-C","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aymenkhs%2FSorting-algorithms-in-C/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aymenkhs%2FSorting-algorithms-in-C/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aymenkhs%2FSorting-algorithms-in-C/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aymenkhs","download_url":"https://codeload.github.com/aymenkhs/Sorting-algorithms-in-C/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241688672,"owners_count":20003516,"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":["bubble-sort","c","complexity","heapsort","insertion-sort","mergesort","quicksort","sorting-algorithms"],"created_at":"2024-11-14T09:19:33.409Z","updated_at":"2026-05-31T01:31:07.858Z","avatar_url":"https://github.com/aymenkhs.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"An Implementation and comparaison between different sorting techniques in C, as a Master 1, Artificial inteligence Algorithmic project.\n\n# Implmented Sorting Techniques\n* [Insertion sort](https://en.wikipedia.org/wiki/Insertion_sort)\n* [Bubble sort](https://en.wikipedia.org/wiki/Bubble_sort)\n* [Quicksort](https://en.wikipedia.org/wiki/Quicksort)\n* [Merge sort](https://en.wikipedia.org/wiki/Merge_sort)\n* [Heapsort](https://en.wikipedia.org/wiki/Heapsort)\n\n# Approach\n\nWe first implemented the different algorithm then tested their execution time with tables of n integers with three different scenarios (the integers are ordered, ordered in reverse and random), the values of n used are:\n\n| n | 6.4*10^4 | 1.28*10^5 | 2.56*10^5 | 5.12*10^5 | 1.024*10^6 | 2.048*10^6 | 5*10^2 | 10^3 | 2*10^3 | 4*10^3 | 8*10^3 | 1.6*10^4 | 3.2*10^4 |\n|---|----------|-----------|-----------|-----------|------------|------------|--------|------|--------|--------|--------|----------|----------|\n\nWe then proceeded to make plots of the executions time for each technique in python using seaborn and pandas in the file results/graphs.py\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faymenkhs%2Fsorting-algorithms-in-c","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faymenkhs%2Fsorting-algorithms-in-c","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faymenkhs%2Fsorting-algorithms-in-c/lists"}