{"id":26429100,"url":"https://github.com/tornao2/sortingalgorythmsdemonstration","last_synced_at":"2025-06-11T14:34:43.754Z","repository":{"id":240428937,"uuid":"802174960","full_name":"Tornao2/SortingAlgorythmsDemonstration","owner":"Tornao2","description":"A program about sorting algorithms made in c++ with the use of \"raylib\" graphical library.","archived":false,"fork":false,"pushed_at":"2024-06-04T10:31:08.000Z","size":1034,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-18T04:53:03.915Z","etag":null,"topics":["cpp","raylib","sorting-algorithms"],"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/Tornao2.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-05-17T17:01:55.000Z","updated_at":"2024-12-28T11:44:27.000Z","dependencies_parsed_at":"2024-05-18T20:24:59.187Z","dependency_job_id":"fc46a3ac-8b8a-4cb0-96bd-e793f5f6a7f8","html_url":"https://github.com/Tornao2/SortingAlgorythmsDemonstration","commit_stats":null,"previous_names":["szyzub/sorting-algorythms","tornao2/sorting-algorythms","tornao2/sortingalgorythmsdemonstration"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FSortingAlgorythmsDemonstration","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FSortingAlgorythmsDemonstration/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FSortingAlgorythmsDemonstration/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Tornao2%2FSortingAlgorythmsDemonstration/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Tornao2","download_url":"https://codeload.github.com/Tornao2/SortingAlgorythmsDemonstration/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244159986,"owners_count":20408019,"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":["cpp","raylib","sorting-algorithms"],"created_at":"2025-03-18T04:53:13.095Z","updated_at":"2025-03-18T04:53:14.699Z","avatar_url":"https://github.com/Tornao2.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"A program about sorting algorithms made in c++ with the use of \"raylib\" graphical library.\n\nDemonstration at:\n\nhttps://www.youtube.com/watch?v=n2OfB4Zg9cE\n\nIt includes these sorting algorithms:\n\n![ScreenShots](https://github.com/SzyZub/Sorting-Algorythms/blob/master/ScreenShots/1.png)\n\nEvery sorting algorithm has explanations and a demonstration of it in action.\n\n![Explanation](https://github.com/SzyZub/Sorting-Algorythms/blob/master/ScreenShots/2.png)\n![Demonstration](https://github.com/SzyZub/Sorting-Algorythms/blob/master/ScreenShots/3.png)\n\n\n\nSidenotes:\n\nAll explanations were made by me including the pictures\n\nAll demonstrations are done on random integer array with 100 fields, with each field having a number from 0 to 99(no duplicates)\n\nSpeed of the algorithm in demonstrations isn't equivalent to its real speed, even comparably to other algorithms, because:\n\n1.function showing array representation on screen was placed manually in each sorting function, so as to show the best how they work(some algorithms even have them be called multiple times in one run through), there can be other ways to place them.\n\n2.function showing array representation on screen has inbuilt sleep for 12ms so it can be seen easier how these sorting algorithms work.\n      \nIf pressing left mouse button to exit a demonstration doesn't work, holding should to the trick.\n\nStalin sort is done by making any \"discarded\" field have a value of -1, which means it doesn't show up on the screen.\n\nCounting sort demonstration is a bit incomprehensible, so\n\nfirst it shows array counting all instances of a certain number \n\nthen it shows that same array being changed so as to show where a certain number should be placed\n\nand lastly it shows the output array being filled.  \n\nThe reason why the two last things show the same result is because each value shows up one time, if it wasn't so, they would be different. Also, the reason that there are random \"lines\" during the last part is because the created output array isn't initiated with any values, they are random.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftornao2%2Fsortingalgorythmsdemonstration","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftornao2%2Fsortingalgorythmsdemonstration","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftornao2%2Fsortingalgorythmsdemonstration/lists"}