{"id":20295120,"url":"https://github.com/agnjason/quicksort","last_synced_at":"2026-05-14T13:32:45.277Z","repository":{"id":211544981,"uuid":"236893884","full_name":"agnJason/Quicksort","owner":"agnJason","description":"实现快排","archived":false,"fork":false,"pushed_at":"2020-01-29T03:17:39.000Z","size":2,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-04T05:31:52.246Z","etag":null,"topics":["python","quicksort"],"latest_commit_sha":null,"homepage":null,"language":"Python","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/agnJason.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":"2020-01-29T03:17:05.000Z","updated_at":"2020-02-27T13:13:24.000Z","dependencies_parsed_at":"2023-12-09T08:51:56.903Z","dependency_job_id":null,"html_url":"https://github.com/agnJason/Quicksort","commit_stats":null,"previous_names":["agnjason/quicksort"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/agnJason/Quicksort","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2FQuicksort","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2FQuicksort/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2FQuicksort/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2FQuicksort/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/agnJason","download_url":"https://codeload.github.com/agnJason/Quicksort/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/agnJason%2FQuicksort/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33026844,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-13T13:14:54.681Z","status":"online","status_checked_at":"2026-05-14T02:00:06.663Z","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":["python","quicksort"],"created_at":"2024-11-14T15:33:14.481Z","updated_at":"2026-05-14T13:32:45.218Z","avatar_url":"https://github.com/agnJason.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Quicksort\n实现快排\n一、简介\n快速排序的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。\n二、问题描述\n设要排序的数组是A[0]……A[N-1]，首先任意选取一个数据（通常选用数组的第一个数）作为关键数据，然后将所有比它小的数都放到它前面，所有比它大的数都放到它后面，这个过程称为一趟快速排序。值得注意的是，快速排序不是一种稳定的排序算法，也就是说，多个相同的值的相对位置也许会在算法结束时产生变动。\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagnjason%2Fquicksort","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fagnjason%2Fquicksort","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fagnjason%2Fquicksort/lists"}