{"id":25077797,"url":"https://github.com/biplo12/sorting-algorithms","last_synced_at":"2026-04-09T01:31:04.049Z","repository":{"id":176052801,"uuid":"654894918","full_name":"Biplo12/sorting-algorithms","owner":"Biplo12","description":"Visualize sorting algorithms in action.","archived":false,"fork":false,"pushed_at":"2023-08-25T11:45:42.000Z","size":97,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-01T00:48:33.175Z","etag":null,"topics":["react","tailwindcss","typescript","vite"],"latest_commit_sha":null,"homepage":"https://sorting-algorithms-brown.vercel.app","language":"TypeScript","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/Biplo12.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-06-17T09:01:52.000Z","updated_at":"2023-09-02T13:39:28.000Z","dependencies_parsed_at":"2024-01-07T05:17:49.363Z","dependency_job_id":null,"html_url":"https://github.com/Biplo12/sorting-algorithms","commit_stats":null,"previous_names":["biplo12/sorting-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Biplo12/sorting-algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Biplo12%2Fsorting-algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Biplo12%2Fsorting-algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Biplo12%2Fsorting-algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Biplo12%2Fsorting-algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Biplo12","download_url":"https://codeload.github.com/Biplo12/sorting-algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Biplo12%2Fsorting-algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31581864,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-08T14:31:17.711Z","status":"ssl_error","status_checked_at":"2026-04-08T14:31:17.202Z","response_time":54,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["react","tailwindcss","typescript","vite"],"created_at":"2025-02-07T02:38:13.304Z","updated_at":"2026-04-09T01:31:04.026Z","avatar_url":"https://github.com/Biplo12.png","language":"TypeScript","readme":"## Sorting Algorithms Visualization\n\nThis project is a simple representation of how various sorting algorithms work. It provides a visual demonstration of how different algorithms sort an array of elements. The web application displays a graphical representation of the array as bars, and users can select different sorting algorithms to observe their effects on the array.\n\n### Features\n\n- Randomly generated array represented as bars\n- Buttons for selecting popular sorting algorithms\n- Dynamic visualization of sorting algorithm execution\n- Regenerate array button to generate a new random array\n- Stop button to halt the sorting process\n\n### Technologies Used\n\nThe project is built using the following technologies:\n\n- Vite: A fast web development build tool that provides a modern development workflow.\n- Tailwind CSS: A utility-first CSS framework used for styling and layout.\n\n### Getting Started\n\nTo use this project locally, follow these steps:\n\n1. Clone the repository to your local machine or download the source code as a ZIP file.\n2. Open a terminal and navigate to the project directory.\n3. Install the dependencies by running the command `yarn install`.\n4. Start the development server with the command `yarn dev`.\n5. Open your web browser and visit the URL provided by the development server.\n\n### Usage\n\nOnce the web page is loaded, you can interact with the application as follows:\n\n1. **View the Initial Array**: The array is represented by bars on the screen, where each bar's height corresponds to the value in the array.\n2. **Choose a Sorting Algorithm**: Click on any of the sorting algorithm buttons (e.g., \"Selection Sort,\" \"Bubble Sort,\" etc.) to initiate the sorting process using the selected algorithm.\n3. **Watch the Visualization**: The bars will animate as the sorting algorithm progresses, providing a visual representation of how the algorithm rearranges the elements in the array.\n4. **Regenerate Array**: If you wish to generate a new random array, click the \"Regenerate Array\" button. The bars will update to reflect the newly generated array, and you can select a sorting algorithm to observe its execution on the new array.\n5. **Stop Sorting**: At any point during the sorting process, you can click the \"Stop\" button to halt the algorithm's execution. This will reload the page and generate a new random array.\n\n### Supported Sorting Algorithms\n\nThe project currently supports the following popular sorting algorithms:\n\n- Selection Sort\n- Bubble Sort\n- Insertion Sort\n- Merge Sort\n- Bogo Sort\n- Quick Sort\n- Heap Sort\n- Counting Sort\n- Radix Sort\n- Bucket Sort\n\nFeel free to explore the project, experiment with different sorting algorithms, and observe how they sort the array in real-time.\n\n### License\n\nThis project is licensed under the MIT License.\n\n### Acknowledgments\n\nThe project draws inspiration from various online resources and tutorials on sorting algorithm visualization. Some of the resources that helped me build this project are listed below:\n\n- [Geeks For Geeks](https://www.geeksforgeeks.org/sorting-algorithms/)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbiplo12%2Fsorting-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbiplo12%2Fsorting-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbiplo12%2Fsorting-algorithms/lists"}