From 609652bc83626e24b5a4da81ec3ffdc3c3e82b94 Mon Sep 17 00:00:00 2001
From: "antoine.perederii" <anperederi@etu.uca.fr>
Date: Thu, 24 Nov 2022 11:54:59 +0100
Subject: [PATCH] ajout du tp11 d'algo

---
 Algo/tp/tp11/exe        | Bin 0 -> 17424 bytes
 Algo/tp/tp11/testtp11.c |  70 +++++++++++++++++++++++
 Algo/tp/tp11/tp11.c     | 121 ++++++++++++++++++++++++++++++++++++++++
 Algo/tp/tp11/tp11.h     |  18 ++++++
 4 files changed, 209 insertions(+)
 create mode 100755 Algo/tp/tp11/exe
 create mode 100644 Algo/tp/tp11/testtp11.c
 create mode 100644 Algo/tp/tp11/tp11.c
 create mode 100644 Algo/tp/tp11/tp11.h

diff --git a/Algo/tp/tp11/exe b/Algo/tp/tp11/exe
new file mode 100755
index 0000000000000000000000000000000000000000..deb18f3e49fe7d7ca475a25d11258111b136beb9
GIT binary patch
literal 17424
zcmeHP4RBP~b-ufcK-gv_W3Xl8gcrvy5L=4`m<rp}lF)-EM}P{F<0QaprCp)L(yqKe
zRN#`32wd-|a>>+boHm^yf34F=n`EYOXxh}`#|YO+3K=&A5;v+Vw~IxH978H6GTZOm
zd(YeVR*RcXr<rtS@677ld(QdJx%b?k_wKvz>7!=LdauVLIQhhH2`Y6|Do(u?9C|=!
zK<Y)ExE_DsE#4(&qdZIUl)PRMNLA|bx@o!Q`#=fztd<wj+qE83t|3vvT`L_fQxc{^
zw}Ws}q|3}_y7qd7W6FHnpP}TUfOb#-keE7gB+6DxvB<7<(^lQ?M>J&|6$v+`aZ?({
zbc`y5#FXPnF`?fHZLg3v5eSJX=~8NaEfuDG)g7`pgTAcTf+^#E8#vu`t?|x;!@foP
zyH;GPbp4s?=8EOL(azPYmiLCMd!w=RK=nY~>gv_20?Bw_g>3f%xTi6-VN<)<|8M8o
zm!#TW?|I?eZr_97{zd9*pIS-vraF*4(xF89+MT3xP$s!**T;|(f_Rk9M84ana>f5P
zfo&8Kk-hmv_~fG)pT>JJeh2sleuXIxhEd2wc^-bcOWo4`bSf$O6VX_zTLgn$1EFAd
zG#2WO?v0>`Aa@0msZb&n><dL>g31)*)nY?SbK|<;iolA%y&~A$wlNrvBqBSb$y6lK
zwsBo=JQisSb@q~toqh3`wh>gSMHOYOyokH%0qzG6dLRH9kC*gq(Ye%1b-EQik9geI
z->3wWdY&*}Xnsw-k~5#nXCG92>Idp0PGb%}k9Cq|9elmSNXVpv@0<@)4nB_|0#wyY
zm>gH!X5ttQK8?##Dn+0afl>rY5hz8V6oFC%N)aeU;Qt~5*5Ji*YpCp%<w95oM^fJ0
zX>0IA`ElD-?%r1+%H1`NzZHw?k)v`C$uErMknTE9Wx9pFa9Wl>hjRBJHc<QH=FFKL
zR_0Y}aD1}0t!23Eo7chB@Vu>(tX+kh>D<DHfw^3<7@H_-c<pCVu!hV2n8=!`)IwA*
zKzUSeZf>k%@qV&>TvO;jCiU;#MP%7kD>G>wz4V}UbjoLWPFiQKrWU|JnKn?K8|#*S
z7{7mQEkq){yxkgH`|q^#urjZuZm@>d&IdnRjV5J#@aJUNT$DZA8OQX(;}Et3gFse}
zn$xsr7&50bquDsJ8FOmLoXVU;E&s$X#1RNZ_Qk8Y+@TkbYf%5FIYR7FQ*PNu%~N#y
zKWcuPERC9{X|pkEzD)a<QS&Tq8Ai<?-YUr${-QLln1`qjM$M;H=^16^Gs=p58Zv5r
zL0OT{T1L$;D=S}BR{mPyrqM01GDW4K_GxR_9Lap&LUUe*!Hju%$h<6@GlmVOYR=E!
z&gIa)H^IpM3-T`1t8Nr2Dbxvt`WB&{m8hwqjmq73$=zET*ba{>fZwyRPb%!k2-{l(
zd#jB6<-vWIMY@XNe`~{=0hzd&`7hc0T4nZqWOiW@v$rd=L+$8O6@+it*elaA2$yaE
z_8juAAhc_sM*WSAdS0Q95bE=c+IWb9Ze?T`cIBIrnu|&C46qY(Xm%iD$)2E`ifO+x
z7bSCT$ma)Hjdi3m9@`a9Cjc@pb&r}q1N=xRorvs?M-$+UgLjd7UJd}%;1cyhn{;oF
z;SIK{GUe(jo|<JZ{DRuvKCVD=uxwU1aK=?712*y{slE0DA-|%K=dIz58Z8^$VWZD0
z^jsS~tk6#o`mvdQhZJ&f-;|KyqEN_iJ&KI7bsjktt_Ef6KC*R}T@z}!Y{TaYYw>j(
zIY%M!5L9F*e(nskdkJ`6nc$)Jlx^T7K$tVnW3pxc0(rG!oOi1SZS_wn^+Tloc;26C
z#;sURj?moSE|-+8Scs}J`z{XdyXZ;Jkt!1lhs=w^kHE{t!K{boGS)25S!-zflv;))
z#>(u=X42z>`^G(KToTOekeDze#T*(RZp~5N8XTFW!gHd)2HYCOOw<+wzXWi`oK{}e
znA0C&hdxANW}PzaW3pN|GGMIY>5+=(MkelYGtQE)epS(7Yu1oCmN{l+{xSRInRTs1
zU8geX%bE5`xlZUvt-;i`p0S1(9Hdnd)~77b=^?SkoJ1@s$P>3fW7xt3pCqZ8rO(2?
zy`XaxxYFFT)@xMm1!pYoMwO2qeQR;;sm!ru|A1iR8Ou(sIku0D<>U0fiu<+gO<9@r
zWTssWqnoLzLzVbDiC7%d!LM_3Q#yq2p}{6c%cO-)ASD_#dO`cNGgPt@NTK36abSc;
z>rEQsp%v(R&>tM}*wIxG)NKarZpD$cd{X|khFd*(TXIrAS744hOE%TYv}f}sanB)(
zlX@-qC}0!I^A57oLDqIKY>^{qpQPb-xWGw~I?pF{ZnYd&tMb-KP<Jf-E@^UR8~%(c
zQzmEjFA<gp$Sy_lNvsnzv~|~bjwy%YNw3sUepD0wIr~Lt6AG3TS>3y_zIf4Nbe}Ns
zZhK|<4se;{vgn1+zemxz&|qD{y#*N<H7^rXu2N;F;lzE?AhMSymg6c!w=WZm)V0=g
zI)j0St0&z}P2whG(46*QZrpEP{KzZdY(L%|s91ae2q79i&@#NX;=RZ`+?@G-Lwj@P
zN<&*iX1d)Pt`=Z#ZCUm<rc8O(cLm`%`nE5%sP+dHi$zQ3r!ARFO_~2_$SwGhHF(@(
zt$8K=I^7F@czeUPhV2bI8iKgz6UX6$@b0^0>ALi%6oFC%N)h;f6#<Vve{1eF_81}K
zuCS4e?CgugQpxK?OUOvZ`}!hAIFdBLibfKk$rQ9`mnhTPUm}sA-J#w{I$`uhW6?fj
zZ8I$qBNp%LOu)&KcvlxTB(W}d3rDCb4qtf_;K!Dbq(20`P%LS{T#61KLupxO?MmZk
zXsCL-?2)zJkkQ|pP8$7*cvlZK85Owao$U982HZ`FhABpmr6WlZj&^tBd^DC4Eoh9c
z+yJ5(L+}t;K_S7R>CQ9-1-{_Ds|P2pj=<QQu6Tbmq6Ml~v}#v8))h)cVoo94DQPnA
z4Zbv@FPcbTzo!CAw(`-B7+vvnza4VVBH#UV=1<QE$}i<|1}@rlpcbeFIthODPja~q
zlsiH9gO0wD%N+)-c{7(A0X+;l2KseS8fF(j4bbY#xm-QyKF|)(bD#%6SK^ZV1<)^o
zo&dc9Iu5$yXSv)gpAeq_y%Tf{v<cMw&s;7H`Yh-H(DEtZLAQX?Q<Nj1S<tGta=9Ap
zttioZ0+c*^w+PQbrDxF%bIK2S=2Q}&&fZ&poXg!!3OW_n7vfIHNq_7jY?H3Pa=pLm
zp^EE&r+mM7@V5KkxAM+Ah)wt={IbyFGic%yb{l>#z~8;ZXz*7);axXxc0VeFBFTRj
zzw?ks5CdE8>+q5W$v=bN;>lbtiWukRVGqmy4(uNENk6D9_dY5e5dMew9f5qIQ{I~Q
zKMnq0LcYo=HwS&YphEcD;rA%y)IQrj<a@RJ0mxs2ywxf9zF#^pz}p7-!k^}H+njRX
zy<75ipmDVkIv;ZCc-y4{)q%#_??Ik$$@^?Mjl*-07pnu|X?)JbxQx2+VH;25b_?Vy
zo$^?|el(sVkZ*R%y${)V8s|?#9&yP#Y`Gl&kaxM{J8b!W;BTjS;*x(@$_?-iL%t32
zhn#YXVZBt5<AmnY$D!kjv-bm1f%=Z-*eS@jlZ{4y<sW#P{Z&u-OusQa%k(e({jw&1
z%@eaNf8F4m4gUIF{<;Q#O@n`Fqu*%sS3$qgUoPL*xCe7>40aIGQYuBD6oFC%N)aeU
zpcH{$g9z|@lKfsIU!&>7lM>DvRH{@2CoVFrTBIoL11RzPmzpj3p7u5+7W^J2-CI#&
z`IW1=xGduyff5~SQkv9des{7)mwAJkQEGJ5B2$&7@}5=aiD;M*^@@pG8kuS|<@<Pk
z7xNa)@7EP!{#R!y0oQv(>)|C-nb<#0fMk2Xl&W~RD$9p79uGccnd6MxbXnf3<=B$Q
zvR!X&|5r`;z4Ai8tMxcouPMv<{n-uc*4<|;ZHjb8LouVa2JZ#eR<B;BbH<9A6}2_B
zwH$l~7f_$@*zf;4MLyxR-(z?4eIm;p>k#<x26%aqK>9Gscsx1OF;-^V<Ic^WBe;Lu
z{Bptl>gLZCJYL-V>jaN0Hy@+8Af6=mVfGnC`SV0;QNG{)KErLlLhyWb^I^nra#Y@j
z#em=YcS?PD1AX!iCx`WKvgf~3>ccLV=e?W1P!t<qK5?_)_pjahn3eTTj>`K)l~`Jo
zf2*h~%IDQ6Z;R&PEb&Gz&rvyA_q@U{4i&^1Z)-^YNCE#nn$PQ~vLeK9BICi+60Q%=
z`*o5(Gd{bt9eZ8YhIUK+nQ{Ik_{Hk~>1*(>)!xI>{(Q0RH;^ev#q9r;)VXO!|2_}C
zN6hTsQ(B*|6YSy#GBb0$U6OWY_WK7h&%Lzj7sP)S8a5yORiiIJ9Ong^|0TUZZ`O_t
z@C}`Jk~buO=D4C~7G&ShLrCtc0c??crv;VY4t^!ZC-*yR_(|V8b3TT({Woq_njg}D
z#5L?6)cU6Wo<Tk<0_G1j-_jSter@Non!jCNu)8$>E1LgF?N>evfb6K|PwBYH=M><d
zk$eqyke`50?Jb;-)8HEpJ<eW_ex!Kr*7oId6bNqv|3+_>;OhzNFCjj4x}iAwaw%48
zJKxdmmCvN0(xCYs-L58WXtU;@*8M1-Z9o>(d{gVUYW;75R$~6v*K39*JGK6gZc+^S
ztPR;KXfL&^Lyu2>X85?)pQqa^pDRKCAoygzaGZQX>mSkW(nS1`=I_$==l=S0&EKoX
zgM2m!``^&~5#8?{;8A)3e2R0S-!tGFQp5dc0{lDNELob3>npYQTl&U{<93VYzhCp^
zb2vhDB~r;$y1P5jCGwvN1yg;&F8Wv~i4TRs@!-zhcxR|L7*53#$zUiwAiCmx{k@S?
zBpj$Iu0dZbMT4P4BD5!n=j(|*qB{}liv+{zzP>$xI7&fird+BiJm^pL*Vdv=!QlEW
z4I9m%xv43L&y?J{VG(Tl;HHL+&FkC}`DGMX_<$^ETH1ouv_%9rv}|r{XbEm!zkaLP
z7Hn&1Y%$5I{GO^SnU=Li<M1GVoqWvyj^9x2iliGuI2wqB(qWvr2>N8J-t_@iBpgbG
zL?VKdiUfWShkD!eH(f40YOgr}m1tL_Rya#5Wu!w1u8ul`*=!%cv_Y;97r4TOABVX-
zp*K+@_1PEN?fM3c&pB*E;bc766N-iDbFt>l0EMHmU^*EIi&*DYeflKi$<rov>eS{8
zCH1PnIg)I&vrQ|s0~$kU*$P5+CX>2S@_V*|$gXh3WW}aV*p&w)c2)6h8xIls=&k6N
zZ0@h<Tw!tc(8ka}TfWO$an{r-kD4B76C#k@(}z<c&{RUv9?s!Iy-1>81Y+@2B(O7<
z4s@oY_zE%_)~trc=IT^vr;xIqP_jn^!h2${r)VmnB)f5T7mdeUg&<^!NN<P$I@jNu
z5&;?E0J4FdaTHUL0sN(T2c@_id4Wieo@qT{7~ztFswt-soQH={U$hJE<0-O?%Fzf8
zpnpUF9Y!aPMOK~vIg4%!ur%Y|L8WVbSFFWSm-9s5iy!R;8Bfp7DKWiM745%#ePYIH
zWSn^3uP`-OQPV;^UB7U=6=(mvuVKpmdH>A&R5rT_8QLo|p7%dYN3<e;_sDpCxe^aU
zjwRj3Pf`JiDeuP>SH+t1M0emvdtdg?`zfaSa%u1XS&!+Xz|&ru%e?PmYCuk@u>OiG
z#9m}5ri|zP8PgH1SQtNU{{f9})Ox&+V_M_D(<QGkeoui%<By+b(5;M2n(E7>W~#c{
z1!O3`PQ0OUOxZtU3e1bA3-G*uWXknrJeQgNX#u`NJ79X|Iz}qW{+avv0zB_WneuZK
z)~CL5rZ1u3oWH`*Qcd~0aLu*j&*iTn<HYm+mg&o^sA-{pwXeyKAKnKu?bq{x&2Zef
z{30@b{8)|mLHxaYp+1+H{u8hj4m|IxC#%6kVm(#Lmzn>s5YX6T|GfX^|0gg;!9n8j
z$vE!EXCNaL#`8Y?>~ca0u~ZTJFXNfM4v7;l>a}W(qW>NK%>q2{GnQ&R*Hc@a5s$YZ
zpt^AV`M$SK<GG%U*WuuzxQZO{w7Sh_{1Tg^GK_apUVEIX9opcOe$YtIM+5kAeR%z$
j`N4H};vcC~rRoA9`(<6)78IyR(ZTzb#+(8`K~ek{^~!qf

literal 0
HcmV?d00001

diff --git a/Algo/tp/tp11/testtp11.c b/Algo/tp/tp11/testtp11.c
new file mode 100644
index 0000000..5b3d3e5
--- /dev/null
+++ b/Algo/tp/tp11/testtp11.c
@@ -0,0 +1,70 @@
+#include "tp11.h"
+
+void testExercice1()
+{
+    int n = 4;
+    int result = nbSegments(n);
+    printf("Il y a %d segments\n", result);
+}
+
+void testExercice2Nb()
+{
+    int tab[10] = {0, 2, 3, 4, 5, 8, 2, 25, 0, 2}, tab2[10] = {1, 2, 3, 4, 5, 8, 2, 25, 0, 2};
+    int n = 10, result, val = 2;
+    result = sommeNentierT(tab, n);
+    printf("La somme des entiers est %d\n", result);
+    printf("====================================\n");
+    result = minValT(tab, n);
+    printf("La valeur minimale est %d\n", result);
+    printf("====================================\n");
+    result = nombreOccurencesT(tab, n, val);
+    printf("Le nombre d'occurences de %d est %d\n", val, result);
+    printf("====================================\n");
+    result = rechercheValT(tab, n, val);
+    if(result == 0)
+        printf("La valeur %d n'est pas dans le tableau\n", val);
+    else
+        printf("La valeur %d est dans le tableau\n", val);
+    printf("====================================\n");
+    result = recherchePlusProcheXT(tab, n, val);
+    printf("La valeur %d est la plus proche de %d, dans le tableau\n", result, val);
+    printf("====================================\n");
+    result = rechercheValMaxT(tab, n);
+    printf("La valeur maximale est %d\n", result);
+    printf("====================================\n");
+    result = compare2T(tab, tab2, n);
+    printf("Les tableaux sont %s\n", result ? "identiques" : "different");
+    printf("====================================\n");
+}
+
+
+void testExercice2Chaine()
+{
+    char tab1[10]="bonjour", tab2[10]="aurevoir";
+    int n = 10, result;
+    char result2[10];
+    result = longueurChaine(tab1);
+    printf("La longueur de la chaine est %d\n", result);
+    printf("====================================\n");
+    result = copieChaine(tab1, tab2);
+    printf("La chaine copiee est %s\n", tab2);
+    printf("====================================\n");
+    result = concateneChaine(tab1, tab2, result2);
+    printf("La chaine concatenee est %s\n", result2);
+    printf("====================================\n");
+    result = compareChaine(tab1, tab2);
+    printf("Les chaines sont %s\n", result ? "identiques" : "different");
+    printf("====================================\n");
+    result = mirroirChaine(tab1, result2);
+    printf("La chaine mirroir est %s\n", result2);
+    printf("====================================\n");
+}
+
+
+int main(void)
+{
+    //testExercice1();
+    //testExercice2Nb();
+    testExercice2Chaine();
+    return 1;
+}
diff --git a/Algo/tp/tp11/tp11.c b/Algo/tp/tp11/tp11.c
new file mode 100644
index 0000000..93ccafd
--- /dev/null
+++ b/Algo/tp/tp11/tp11.c
@@ -0,0 +1,121 @@
+#include "tp11.h"
+
+/*  Exercice 1  */
+int nbSegments(int n)
+{
+    if (n == 1)
+        return 0;
+    return (n-1) + nbSegments(n - 1);
+}
+
+/*  Exercice 2  */
+
+int sommeNentierT(int tab[], int n)
+{
+    if (n == 1)
+        return tab[0];
+    return tab[0] + sommeNentierT(tab+1, n-1);
+}
+
+int minValT(int tab[], int n)
+{
+    int min;
+    if (n == 1)
+        return tab[0];
+    min = minValT(tab+1, n-1);
+    if (tab[0] < min)
+        return tab[0];
+    return min;
+}
+
+int nombreOccurencesT(int tab[], int n, int val)
+{
+    if (n == 1)
+        return tab[0] == val;
+    return (tab[0] == val) + nombreOccurencesT(tab+1, n-1, val);
+}
+
+int rechercheValT(int tab[], int n, int val)
+{
+    if (n == 0)
+        return 0;
+    if(val == tab[n])
+        return 1;
+    return rechercheValT(tab, n-1, val);
+}
+
+int recherchePlusProcheXT(int tab[], int n, int x)
+{
+    int min;
+    if (n == 1)
+        return tab[0];
+    min = recherchePlusProcheXT(tab+1, n-1, x);
+    if (abs(tab[0] - x) < abs(min - x))
+        return tab[0];
+    return min;
+}
+
+int rechercheValMaxT(int tab[], int n)
+{
+    int max;
+    if (n == 1)
+        return tab[0];
+    max = rechercheValMaxT(tab+1, n-1);
+    if (tab[0] > max)
+        return tab[0];
+    return max;
+}
+
+int compare2T(int tab1[], int tab2[], int n) //a revoir
+{
+    if (n == 1)
+        return tab1[0] == tab2[0];
+    if (tab1[0] != tab2[0])
+        return 0;
+    return compare2T(tab1+1, tab2+1, n-1);
+}
+
+int longueurChaine(char chaine[])
+{
+    if (chaine[0] == '\0')
+        return 0;
+    return 1 + longueurChaine(chaine+1);
+}
+
+int copieChaine(char chaine1[], char chaine2[])
+{
+    if (chaine1[0] == '\0')
+        return 0;
+    chaine2[0] = chaine1[0];
+    return 1 + copieChaine(chaine1+1, chaine2+1);
+}
+
+int concateneChaine(char chaine1[], char chaine2[], char chaine3[])
+{
+    if (chaine1[0] == '\0')
+        return copieChaine(chaine2, chaine3);
+    chaine3[0] = chaine1[0];
+    return 1 + concateneChaine(chaine1+1, chaine2, chaine3+1);
+}
+
+int compareChaine(char chaine1[], char chaine2[])
+{
+    if (chaine1[0] == '\0' && chaine2[0] == '\0')
+        return 1;
+    if (chaine1[0] == chaine2[0])
+        return compareChaine(chaine1+1, chaine2+1);
+    return 0;
+}
+
+int mirroirChaine(char chaine1[], char chaine2[])
+{
+    if (chaine1[0] == '\0')
+        return 0;
+    chaine2[longueurChaine(chaine1)-1] = chaine1[0];
+    return 1 + mirroirChaine(chaine1+1, chaine2);
+}
+
+/*  Exercice 3  */
+
+/*  Pour vider n, il faut vider n-2, on remet les n-2 en vide les n-2 de ce n        */
+/*  Pour remplir n, il faut remplir n-2, on remplis n-1 vider n-2 et on remplie n-1      */
\ No newline at end of file
diff --git a/Algo/tp/tp11/tp11.h b/Algo/tp/tp11/tp11.h
new file mode 100644
index 0000000..ffc8e8b
--- /dev/null
+++ b/Algo/tp/tp11/tp11.h
@@ -0,0 +1,18 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+int nbSegments(int n);
+int sommeNentierT(int tab[], int n);
+int minValT(int tab[], int n);
+int nombreOccurencesT(int tab[], int n, int val);
+int rechercheValT(int tab[], int n, int val);
+int recherchePlusProcheXT(int tab[], int n, int x);
+int rechercheValMaxT(int tab[], int n);
+int compare2T(int tab1[], int tab2[], int n);
+int longueurChaine(char chaine[]);
+int copieChaine(char chaine1[], char chaine2[]);
+int concateneChaine(char chaine1[], char chaine2[], char chaine3[]);
+int compareChaine(char chaine1[], char chaine2[]);
+int mirroirChaine(char chaine1[], char chaine2[]);
+