{"id":22194183,"url":"https://github.com/filiprokita/sortingalgorithms","last_synced_at":"2025-10-10T11:39:28.482Z","repository":{"id":164833396,"uuid":"435032239","full_name":"FilipRokita/sortingAlgorithms","owner":"FilipRokita","description":"This is a program that demonstrates two sorting algorithms, Bubble Sort and Insertion Sort, by generating a random array of 10,000 integers and sorting it with both algorithms. The program then prints the sorted arrays.","archived":false,"fork":false,"pushed_at":"2023-04-04T12:46:30.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-20T19:40:51.207Z","etag":null,"topics":["algorithms","bubble","bubble-srot","insertion","insertion-sort","python","sort","sorting"],"latest_commit_sha":null,"homepage":"","language":"Python","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/FilipRokita.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":"2021-12-04T23:36:34.000Z","updated_at":"2023-04-04T16:01:11.000Z","dependencies_parsed_at":null,"dependency_job_id":"327cb62b-9aa0-4bc0-aff5-2182040cec0a","html_url":"https://github.com/FilipRokita/sortingAlgorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/FilipRokita/sortingAlgorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilipRokita%2FsortingAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilipRokita%2FsortingAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilipRokita%2FsortingAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilipRokita%2FsortingAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FilipRokita","download_url":"https://codeload.github.com/FilipRokita/sortingAlgorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilipRokita%2FsortingAlgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279003714,"owners_count":26083610,"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-10T02:00:06.843Z","response_time":62,"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":["algorithms","bubble","bubble-srot","insertion","insertion-sort","python","sort","sorting"],"created_at":"2024-12-02T13:11:52.982Z","updated_at":"2025-10-10T11:39:28.444Z","avatar_url":"https://github.com/FilipRokita.png","language":"Python","readme":"# sortingAlgorithms\n\nsortingAlgorithms is a Python program that demonstrates two sorting algorithms: bubble sort and insertion sort.\n\n## How it works\n\nThe program generates a list of 10,000 random integers between 0 and 9. It then applies bubble sort and insertion sort to the list and prints the sorted results.\n\n### Bubble Sort\n\nBubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted.\n\n### Insertion Sort\n\nInsertion sort is another simple sorting algorithm that builds the final sorted array one item at a time. It iterates through the input list, removes one item at a time, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.\n\n## Installation\n\nTo run the program, simply download the code and run it using a Python interpreter. This program does not require any external libraries or dependencies.\n\n## Usage\n\nOnce the program has been executed, the sorted results will be printed to the console.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffiliprokita%2Fsortingalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffiliprokita%2Fsortingalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffiliprokita%2Fsortingalgorithms/lists"}