{"id":23726612,"url":"https://github.com/codenkoffee/selection-insertion-bubble-sorts","last_synced_at":"2026-07-02T23:04:48.640Z","repository":{"id":204102673,"uuid":"711117447","full_name":"CodeNKoffee/Selection-Insertion-Bubble-Sorts","owner":"CodeNKoffee","description":null,"archived":false,"fork":false,"pushed_at":"2023-10-28T09:17:03.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-06-08T12:41:49.366Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/CodeNKoffee.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}},"created_at":"2023-10-28T09:11:26.000Z","updated_at":"2023-10-28T09:11:39.000Z","dependencies_parsed_at":null,"dependency_job_id":"bbd07376-be4e-4c16-81ce-27df83d3602b","html_url":"https://github.com/CodeNKoffee/Selection-Insertion-Bubble-Sorts","commit_stats":null,"previous_names":["codenkoffee/selection-insertion-bubble-sorts"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/CodeNKoffee/Selection-Insertion-Bubble-Sorts","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FSelection-Insertion-Bubble-Sorts","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FSelection-Insertion-Bubble-Sorts/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FSelection-Insertion-Bubble-Sorts/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FSelection-Insertion-Bubble-Sorts/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/CodeNKoffee","download_url":"https://codeload.github.com/CodeNKoffee/Selection-Insertion-Bubble-Sorts/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/CodeNKoffee%2FSelection-Insertion-Bubble-Sorts/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35065713,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-07-02T02:00:06.368Z","response_time":173,"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-12-31T00:32:24.673Z","updated_at":"2026-07-02T23:04:48.605Z","avatar_url":"https://github.com/CodeNKoffee.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sorting Algorithms in Java\n\nThis Java program contains three popular sorting algorithms: Selection Sort, Insertion Sort, and Bubble Sort. Each of these algorithms is used to arrange a given array of integers in ascending order. Below, you'll find descriptions of each sorting algorithm along with instructions for using the program.\n\n## Sorting Algorithms\n\n### Selection Sort\nSelection Sort is a simple comparison-based sorting algorithm. It works by dividing the input array into two parts: the sorted part and the unsorted part. In each iteration, it finds the minimum element from the unsorted part and adds it to the sorted part.\n\n### Insertion Sort\nInsertion Sort is another simple sorting algorithm that builds the final sorted array one item at a time. It iterates through the input array, removes one element from it, and inserts it into its correct position in the sorted part of the array.\n\n### Bubble Sort\nBubble Sort is a basic 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## Usage\n\n1. Clone or download the Java source code from this repository.\n\n2. Compile the code using a Java compiler:\n\n   ```shell\n   javac HelloWorld.java\n3. Run the compiled code:\n\n   ```shell\n   java HelloWorld\n## Contributing\n\nIf you'd like to contribute to this project, feel free to submit a pull request or open an issue.\n\n## License\n\nThis version of the README does not contain any specific licensing information, indicating that the project is open for use and contribution without any particular licensing restrictions.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodenkoffee%2Fselection-insertion-bubble-sorts","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodenkoffee%2Fselection-insertion-bubble-sorts","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodenkoffee%2Fselection-insertion-bubble-sorts/lists"}