{"id":17465203,"url":"https://github.com/cankatabaci/performancetestforsortingalgorithms","last_synced_at":"2026-08-12T04:32:18.388Z","repository":{"id":103722482,"uuid":"86123637","full_name":"cankatabaci/PerformanceTestForSortingAlgorithms","owner":"cankatabaci","description":"This project is a homework made in the course of Data Structures for  compare the performance sorting algorithms.","archived":false,"fork":false,"pushed_at":"2017-03-26T01:03:58.000Z","size":15,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-22T03:34:06.616Z","etag":null,"topics":["performance-testing","sorting-algorithms","sorting-algorithms-homework","sorting-algorithms-implemented"],"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/cankatabaci.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":"2017-03-25T01:21:29.000Z","updated_at":"2019-07-13T22:17:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"7639a0f3-b485-440e-8966-79e386eb226b","html_url":"https://github.com/cankatabaci/PerformanceTestForSortingAlgorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/cankatabaci/PerformanceTestForSortingAlgorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cankatabaci%2FPerformanceTestForSortingAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cankatabaci%2FPerformanceTestForSortingAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cankatabaci%2FPerformanceTestForSortingAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cankatabaci%2FPerformanceTestForSortingAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/cankatabaci","download_url":"https://codeload.github.com/cankatabaci/PerformanceTestForSortingAlgorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cankatabaci%2FPerformanceTestForSortingAlgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":36551380,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-08-06T04:43:03.162Z","status":"online","status_checked_at":"2026-08-12T02:00:07.134Z","response_time":57,"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":["performance-testing","sorting-algorithms","sorting-algorithms-homework","sorting-algorithms-implemented"],"created_at":"2024-10-18T11:09:08.133Z","updated_at":"2026-08-12T04:32:18.370Z","avatar_url":"https://github.com/cankatabaci.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Performance Test For Sorting Algorithms\n\nThis project is a homework made in the course of Data Structures. \nPurposes of the project; Buble, Selection, Heap, Quick and Insertion Sort sorting algorithms to compare their performance. 7 different series including 100, 750, 1500, 7500, 15000, 75000 and 150000 random elements were produced.\n\n### Sorting Performances\n\n5 Different sorting algorithms were compared with 7 different data sets and the results were obtained as follows.\n\n### Total working time(millisecond) by value ranges\n| Algorithms | 100 | 750 | 1500 | 7500 | 15000 | 75000 | 150000 |\n| ------  | ------     | ------  | ------    | ------  | ------| ------  | ------     |\n|Buble Sort|0 |0 |0 |145 |286 |14662 |76890 |\n|Quick Sort|0 |0 |0 |0 |1 |8 |18 |\n|Heap Sort|0 |0 |0 |1 |3 |41 |94 |\n|Insertion Sort|0 |0 |0 |0 |157 |6947 |25469 |\n|Selection Sort|0 |1 |4 |120 |468 |11982 |47912 |","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcankatabaci%2Fperformancetestforsortingalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcankatabaci%2Fperformancetestforsortingalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcankatabaci%2Fperformancetestforsortingalgorithms/lists"}