[hide][code lang=”c”]\/\/\u8fed\u4ee3\u6cd5<\/p>\n
typedef struct _Range {
\n\tint start, end;
\n} Range;
\nRange new_Range(int s, int e) {
\n\tRange r;
\n\tr.start = s;
\n\tr.end = e;
\n\treturn r;
\n}
\nvoid swap(int *x, int *y) {
\n\tint t = *x;
\n\t*x = *y;
\n\t*y = t;
\n}
\nvoid quick_sort(int arr[], const int len) {
\n\tif (len <= 0)
\n\t\treturn; \/\/\u907f\u514dlen\u7b49\u65bc\u8ca0\u503c\u6642\u5ba3\u544a\u5806\u758a\u9663\u5217\u7576\u6a5f
\n\t\/\/r[]\u6a21\u64ec\u5806\u758a,p\u70ba\u6578\u91cf,r[p++]\u70bapush,r[–p]\u70bapop\u4e14\u53d6\u5f97\u5143\u7d20
\n\tRange r[len];
\n\tint p = 0;
\n\tr[p++] = new_Range(0, len – 1);
\n\twhile (p) {
\n\t\tRange range = r[–p];
\n\t\tif (range.start >= range.end)
\n\t\t\tcontinue;
\n\t\tint mid = arr[range.end];
\n\t\tint left = range.start, right = range.end – 1;
\n\t\twhile (left < right) {
\n\t\t\twhile (arr[left] < mid && left < right)
\n\t\t\t\tleft++;
\n\t\t\twhile (arr[right] >= mid && left < right)
\n\t\t\t\tright–;
\n\t\t\tswap(&arr[left], &arr[right]);
\n\t\t}
\n\t\tif (arr[left] >= arr[range.end])
\n\t\t\tswap(&arr[left], &arr[range.end]);
\n\t\telse
\n\t\t\tleft++;
\n\t\tr[p++] = new_Range(range.start, left – 1);
\n\t\tr[p++] = new_Range(left + 1, range.end);
\n\t}
\n}
\n\/\/\u905e\u6b78\u6cd5<\/p>\n
void swap(int *x, int *y) {
\n\tint t = *x;
\n\t*x = *y;
\n\t*y = t;
\n}
\nvoid quick_sort_recursive(int arr[], int start, int end) {
\n\tif (start >= end)
\n\t\treturn;\/\/\u9019\u662f\u70ba\u4e86\u9632\u6b62\u5ba3\u544a\u5806\u758a\u9663\u5217\u6642\u7576\u6a5f
\n\tint mid = arr[end];
\n\tint left = start, right = end – 1;
\n\twhile (left < right) {
\n\t\twhile (arr[left] < mid && left < right)
\n\t\t\tleft++;
\n\t\twhile (arr[right] >= mid && left < right)
\n\t\t\tright–;
\n\t\tswap(&arr[left], &arr[right]);
\n\t}
\n\tif (arr[left] >= arr[end])
\n\t\tswap(&arr[left], &arr[end]);
\n\telse
\n\t\tleft++;
\n if (left) {
\n\t quick_sort_recursive(arr, start, left – 1);
\n\t quick_sort_recursive(arr, left + 1, end);
\n } else {
\n quick_sort_recursive(arr, left + 1, end);
\n }
\n}
\nvoid quick_sort(int arr[], int len) {
\n\tquick_sort_recursive(arr, 0, len – 1);
\n}
\n[\/code][\/hide]<\/p>\n","protected":false},"excerpt":{"rendered":"
[hide][code lang=”c”]\/\/\u8fed\u4ee3\u6cd5 typedef struct _ […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","footnotes":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false},"categories":[1],"tags":[],"class_list":["post-44","post","type-post","status-publish","format-standard","hentry","category-1"],"jetpack_featured_media_url":"","jetpack_publicize_connections":[],"jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p8UC2c-I","jetpack_likes_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/44","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=44"}],"version-history":[{"count":2,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/44\/revisions"}],"predecessor-version":[{"id":58,"href":"https:\/\/haoyuan.info\/index.php?rest_route=\/wp\/v2\/posts\/44\/revisions\/58"}],"wp:attachment":[{"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=44"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=44"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/haoyuan.info\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=44"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}