{"id":25501864,"url":"https://github.com/mdbentaleb/sorting_algorithms","last_synced_at":"2025-11-12T09:30:18.916Z","repository":{"id":237256081,"uuid":"794120819","full_name":"mdbentaleb/sorting_algorithms","owner":"mdbentaleb","description":"Sorting algorithms organize data, while Big O notation quantifies the worst-case performance of algorithms as input size increases.","archived":false,"fork":false,"pushed_at":"2024-05-02T11:01:39.000Z","size":8,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-05-03T13:19:12.230Z","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/mdbentaleb.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":"2024-04-30T13:49:32.000Z","updated_at":"2024-05-02T11:01:42.000Z","dependencies_parsed_at":"2024-04-30T15:52:34.503Z","dependency_job_id":"72d87a12-cd33-41a8-8f5f-c71781419744","html_url":"https://github.com/mdbentaleb/sorting_algorithms","commit_stats":null,"previous_names":["mdbentaleb/sorting_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mdbentaleb%2Fsorting_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mdbentaleb%2Fsorting_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mdbentaleb%2Fsorting_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mdbentaleb%2Fsorting_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mdbentaleb","download_url":"https://codeload.github.com/mdbentaleb/sorting_algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239599017,"owners_count":19665911,"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-02-19T04:59:15.150Z","updated_at":"2025-11-12T09:30:18.140Z","avatar_url":"https://github.com/mdbentaleb.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sorting algorithms \u0026 Big O\n\n\nSorting algorithms are essential tools for organizing data efficiently,\nvital in various computer science applications such as databases and information retrieval.\nThey vary in efficiency, stability, and adaptability to different data types.\nBig O notation quantifies an algorithm's worst-case performance as input size increases,\noffering a concise representation of its scalability and efficiency,\ncrucial for comparing and selecting the most suitable algorithm for specific problems.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmdbentaleb%2Fsorting_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmdbentaleb%2Fsorting_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmdbentaleb%2Fsorting_algorithms/lists"}