From 7a7656ad2609592f835cd09409b7185b6dad4838 Mon Sep 17 00:00:00 2001
From: kemasama <devras.cf@gmail.com>
Date: Thu, 28 Apr 2022 19:53:55 +0900
Subject: [PATCH] add: quick sort split array

---
 README.md                     |   1 +
 quick_sort/array_quick_sort   | Bin 0 -> 33949 bytes
 quick_sort/array_quick_sort.c | 118 ++++++++++++++++++++++++++++++++++
 3 files changed, 119 insertions(+)
 create mode 100755 quick_sort/array_quick_sort
 create mode 100644 quick_sort/array_quick_sort.c

diff --git a/README.md b/README.md
index b673e47..f40ba30 100644
--- a/README.md
+++ b/README.md
@@ -44,6 +44,7 @@ GCCを使用してコンパイルしています。
 
 - 2022/04/22 q_sort
 - 2022/04/26 quick_sort
+- 2022/04/28 array_quick_sort
 
 #### 処理内容
 
diff --git a/quick_sort/array_quick_sort b/quick_sort/array_quick_sort
new file mode 100755
index 0000000000000000000000000000000000000000..7e5c5e7a978f19b974bfb76d3c74e852b9bd4993
GIT binary patch
literal 33949
zcmeI5e{56N702)Mi(5N!8%m<4BoKRLK&U#H*rauo6w?p^?Nm@eT42D%#11j}iS2ZR
z1m?}60yW*1meIAe%=C}dPRAB?>-M6l3&_*7t(&?qiAk+gQ8a0GI?(n<wdY8g_dWML
z2gj_frb+u}=St_@d(OT0+;czYI{E9q_x9|Ke|m(_1d0Q455!j?#7W^pONb?qtq>`9
zY}(Sgr?qW6Sr-;Hd7<exjr^R#Kq+^%w(nZlt>*g|+Jvn;VJ1OHsz@0N9gW!vs&ao5
z>#fa<+7n2pea)8&5ub0PA!Rf+crZF|D)+Zxqvh{_J%aR7e=ge}7^)&=M>G}*_Z^zo
z7w-2Z+h2{{PkL!7^-Xpu2m8Jn?hDFrUuVD47y6s9{q3-wkY4V??ot)y;kytiH*eat
zNw#c%VyBf2zkLW$t5R0$Fp^NN7D1#u)L)W@kMviJOZct%n5xPhc)IL1RkzOBm$p6e
zc<bhE#WNBwiwioHm+kygJnH-?s}P?TB2Mv9man1uoULDjPO%W1`ydZ}U5L9;ANYn4
zNz_%4`B>4WLQ9ZTlJXJdKFnYIZ~Dl$4?^c+?O-&rwkLdWZE&b32%Sm;gyQ)5q3yrB
zGP-WVOE*@{j-T38u?{vL#M%>P>mJo6_Cm}$9>7!WPw7H5VSnUjbF*!*D_Zv<2=&pP
z^`I9&Bkfi!h-c?eG#2Vz^XMAH6+VbTC@Uf4|Fhsj`B`o2#EZ%@h+02^99TgrJ3p8J
z6JP>NfC(@GCcp%k025#WOn?b60Vco%m;e)C0!)AjFaajO1egF5U;<2l2`~XBzyz28
z6JP>NfC(@GCcp%k025#WOn?b60Vco%m;e)C0!-lln?NBUrmt0t{QFfRf4y2v7OKP~
zuA$XttNfF>YX785b9awxVwY{p=c?k9uA#7jzWfZ@O+ybD#qlnuxF?JGe=ij3aE-1F
zzQ-=<@@gTWP0tNG({nA_SW@?z7cz~;D~U#<unOxfhj<|kkUBA$O6)h%nf(T>o2`Kj
z{!-A>u#@dIVa4JS@x`f(*EoV$b2ahFQzCvv9Cx2Hg*cPc8_kry-%JVd2E|q!+gUdD
z2F6~i6ZveNKcBV7CNb~Nuovg-#+;Nc&2;9xLHo{v5yhkSig?xD>->|&_&iQ4KAMxO
zn`fms&e$AF`_fo%W|hS;y9&ICA-H6h+imc{-A5I}yg$S{<F)5_?Qvk3ZLr&5NpTfp
zE5>>id7;>I<XdxBQLc)66K?m@7ZA&J^bHpZ&u5YQH1<%;v5J{;k8!xvJoY|fxQ_J(
zFqW7-uUPu?-%<P}a=hQ5GvsiJBXKoGnxt#k-z&%^tuclCQH;rqH0Fj|(>N#Uyvz+x
zrRQ`pR>)}6xHCE7a{Kcx&7V&tyyjGk*T5MvE+iUF*OGW!N^dkyc~EDT8Hkbcas+u*
z=M`tk6i$D>SH;w**21|ka`2tjmznMlPyBIpvlv@_W8~R%qTa+k%!x$~e_l8?UL8;D
zF=^att@4A78jWu-Q;DTGUhym4@Q3@zXQo<gpDj3_@Jr{j(qXN=7yW7dE9Q7+pW*WS
zw%&ETvcV->-IR;*mh(pOcay?gvZdhbruDnIlGN+XHq6iJVmt{SDSauOXM<R3_+34y
zc<wQ`VN5d704BG`@t7S)3iH!g&rN4ncaIlZ#5DfmeOnAXGDiDr(nNj@{J=g&xhRe2
zuXJ7#n6K|Ov9}NA=f-c%_1beOFDZSW=>@A)i!@T1B}QrP(g~@2T()zQ%<ML%u>Rce
z<rMvmz}jaN|2v4k_o`~&UD94$(!RH(U0>2}ENS0g(q3t`R|G3Xs3$NG4F%WxR`dj;
zxQL8(#ZvoUKxs{PeCe(`?msJOw(pgbPIrerxCLBm-3-_4JIEEnXBlv#H%@-3CO=eL
z_l+0D>Hah6bO)bmy0=aBopudoN_VST#I1^-On?b60Vco%m;e)C0!)AjFaajO1egF5
zU;<2l2`~XBzyz286JP>NfC(@GCcp%k025#WOn?b60Vco%m;e)C0!)AjFaajO1egF5
zU;<2l2`~XBzyz286JP>NfC(@GCcp%kz<)}>hY33%M<MjBbL(9IXrNg4|E)HCOT1WA
z+mE*a_=^^6o`x3)XrG2`h4ev=L7sw~g?u0KI^+`ONGUtIx}&jf84N`5g?lnYV}Xut
zGRw|DxM!i|&|n}E6fzL&4-45D35A604fOQ%cL+HU3HQZ1g^UFHFd}MIv2bsQLer#h
ziVE4=B|}F;9fPru><R^fp@{fmAQA}-$&UVkA<=wfFpQO>{gIe>v^Rigw$O_ZbTKiA
z$C)Sb_$4-iGBFsOASTpZt>LW?D8%btNHrSt4hGWiw{`k1JLyffUi+}6(|Z|Ur!G}m
z@hsK9T&5o`(+A4*C(HB`Wja!@!2f8O{#=<(?|YzkJka|c=-m!<E~+5(UHQ8p#DK=&
z1bpl`AF_Bmds)IBX{79zWZ-{wG!VL&ea~|VWL`$In2TE2=oFt84(!sQQXNKrJA?{w
zB!thQP*|3aefo>NnziYYjXvj`t=Tx0d-kNa?eO0YkDOlqSY&zo%E_j!$9}xyXJ7c<
z<%?hY!Rzh)zshx9s`%6Nbhl%ByR$IzlaXU5-+A-tt*0M+^^^L22Ugr1e&g5Y&USgs
z(G!jDG@pCx_aBD7bv|47<_mYNo1WR1+xf#2fBEM6nv2i8J6bi8+_2)2`q102KJ}w#
z9!|ac-r3`y<p00z|I}+;zuA3f?ai*(<%^!T`d0oz6aP5&humkj{Pg7Bz|`X}{tM&(
BX$=4X

literal 0
HcmV?d00001

diff --git a/quick_sort/array_quick_sort.c b/quick_sort/array_quick_sort.c
new file mode 100644
index 0000000..8495243
--- /dev/null
+++ b/quick_sort/array_quick_sort.c
@@ -0,0 +1,118 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+int
+array_copy(
+    int *array1,
+    int *array2,
+    int array2_size
+)
+{
+    int i;
+
+    for ( i = 0 ; i < array2_size ; i++ ) {
+        array1[i] = array2[i];
+    }
+
+    return 0;
+}
+
+int
+quick_sort(
+    int *array,
+    int left,
+    int right
+)
+{
+    int *group_small;
+    int *group_large;
+    int small_index = 0;
+    int small_size  = 0;
+    int large_index = 0;
+    int large_size  = 0;
+
+    int i   = 0;
+    int range   = right - left;
+    int pivot;
+    int pivot_index = 0;
+
+    if ( left >= right ) {
+        return -1;
+    }
+
+    group_small = (int *)malloc(sizeof(int) * range);
+    if ( group_small == NULL ) {
+        return -1;
+    }
+
+    group_large = (int *)malloc(sizeof(int) * range);
+    if ( group_large == NULL ) {
+        free(group_small);
+        return -1;
+    }
+
+    pivot = array[left];
+
+    for ( i = left + 1 ; i <= right ; i++ ) {
+        if ( array[i] < pivot ) {
+            group_small[small_index] = array[i];
+            small_index++;
+            small_size++;
+        } else {
+            group_large[large_index] = array[i];
+            large_index++;
+            large_size++;
+        }
+    }
+
+    pivot_index = left + small_size;
+
+    array_copy(array + left, group_small, small_size);
+    array[pivot_index] = pivot;
+    array_copy(array + pivot_index + 1, group_large, large_size);
+
+    free(group_small);
+    free(group_large);
+
+    quick_sort(array, left, pivot_index - 1);
+    quick_sort(array, pivot_index + 1, right);
+
+    return 0;
+}
+
+int
+main(
+    int argc,
+    char *argv[]
+)
+{
+    int i;
+
+    int length = 200;
+    int rand_limit = 100;
+
+    if ( argc > 1 ) {
+        length = atoi(argv[1]);
+    }
+
+    int array[length];
+
+    srand((int)time(NULL));
+
+    for ( i = 0 ; i < length ; i++ ) {
+        array[i] = rand() % rand_limit + 1;
+    }
+
+    time_t start_at = time(NULL);
+    quick_sort(array, 0, length - 1);
+    time_t end_at = time(NULL);
+
+    for ( i = 0 ; i < length ; i++ ) {
+        printf("%d\n", array[i]);
+    }
+
+    printf("elapsed: %lds\n", end_at - start_at);
+
+    return 0;
+}