{"id":21358724,"url":"https://github.com/razvan48/sorting-algorithms-visualizer","last_synced_at":"2025-03-16T06:17:38.025Z","repository":{"id":177688652,"uuid":"660766830","full_name":"Razvan48/Sorting-Algorithms-Visualizer","owner":"Razvan48","description":"A simple visualizer for sorting algorithms.","archived":false,"fork":false,"pushed_at":"2023-06-30T20:30:15.000Z","size":14774,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-22T18:50:56.803Z","etag":null,"topics":["sorting-algorithms","sortings","visualizer"],"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/Razvan48.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-30T19:44:47.000Z","updated_at":"2023-09-03T18:57:59.000Z","dependencies_parsed_at":null,"dependency_job_id":"3b9168f2-8148-414c-8018-0db1167078a8","html_url":"https://github.com/Razvan48/Sorting-Algorithms-Visualizer","commit_stats":null,"previous_names":["razvan48/sorting-algorithms-visualizer"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Razvan48%2FSorting-Algorithms-Visualizer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Razvan48%2FSorting-Algorithms-Visualizer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Razvan48%2FSorting-Algorithms-Visualizer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Razvan48%2FSorting-Algorithms-Visualizer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Razvan48","download_url":"https://codeload.github.com/Razvan48/Sorting-Algorithms-Visualizer/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243830953,"owners_count":20354856,"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":["sorting-algorithms","sortings","visualizer"],"created_at":"2024-11-22T05:21:47.470Z","updated_at":"2025-03-16T06:17:37.980Z","avatar_url":"https://github.com/Razvan48.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Sorting-Algorithms-Visualizer\n\n\u0026emsp; This is a simple visualizer for sorting algorithms. \u003cbr/\u003e\n\u0026emsp; Right now it is able to simulate Bubble Sort, Quick Sort and Heap Sort. \u003cbr/\u003e\n\u0026emsp; Every two columns that are swapped at a certain frame are coloured in green, the rest of the columns are coloured from lighter blue to darker blue, \u003cbr/\u003e\ndepending on the value they represent. \u003cbr/\u003e\n\u0026emsp; Once the whole array has been sorted, the program colours all the columns in green, starting from the smallest column (left) to the biggest one (right). \u003cbr/\u003e\n\n\u003cp align = \"center\"\u003e\n  1. Bubble Sort, complexity O(n\u003csup\u003e2\u003c/sup\u003e) \u003cbr/\u003e\n  \u003cimg width=\"505\" height=\"425\" src=\"https://github.com/Razvan48/Sorting-Algorithms-Visualizer/blob/main/Demo/Bubble Sort.gif\"\u003e \u003cbr/\u003e\n  \u003cbr/\u003e \u003cbr/\u003e \u003cbr/\u003e \u003cbr/\u003e \u003cbr/\u003e\n  2. Quick Sort, complexity of average case O(nlog\u003csub\u003e2\u003c/sub\u003en) \u003cbr/\u003e\n  \u003cimg width=\"505\" height=\"425\" src=\"https://github.com/Razvan48/Sorting-Algorithms-Visualizer/blob/main/Demo/Quick Sort.gif\"\u003e \u003cbr/\u003e\n  \u003cbr/\u003e \u003cbr/\u003e \u003cbr/\u003e \u003cbr/\u003e \u003cbr/\u003e\n  3. Heap Sort, complexity O(nlog\u003csub\u003e2\u003c/sub\u003en) \u003cbr/\u003e\n  \u003cimg width=\"505\" height=\"425\" src=\"https://github.com/Razvan48/Sorting-Algorithms-Visualizer/blob/main/Demo/Heap Sort.gif\"\u003e \u003cbr/\u003e\n\u003c/p\u003e\n\n**Controls:** \u003cbr/\u003e\n- Esc for closing the application \u003cbr/\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frazvan48%2Fsorting-algorithms-visualizer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frazvan48%2Fsorting-algorithms-visualizer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frazvan48%2Fsorting-algorithms-visualizer/lists"}