From 782aaaed523b367609993756bd4d5f01e4131738 Mon Sep 17 00:00:00 2001 From: Jannaire Date: Wed, 15 Oct 2025 11:41:05 +0200 Subject: [PATCH] tp4 --- TrieSelection.class | Bin 0 -> 2024 bytes TrieSelection.java | 60 ++++++++++++++++++++++++++++++++++++++++++++ reponse.txt | 21 ++++++++++++++++ 3 files changed, 81 insertions(+) create mode 100644 TrieSelection.class create mode 100644 TrieSelection.java create mode 100644 reponse.txt diff --git a/TrieSelection.class b/TrieSelection.class new file mode 100644 index 0000000000000000000000000000000000000000..9cfff1603420475d73d8bd77a0bf7d33808b502f GIT binary patch literal 2024 zcmX^0Z`VEs1_pBmKQ0CV1|@a|Wex@vE(RtBRSpI<4hD5D27U$&5TVJ=par6}IT>^q zbcGlg7!0`>j2MhTgb6!?DLaE1BLkaFW?p8A9U}v?hGrNe1B-KhN-84*zfWdfs$Xet zQfg61Vp2{jBLj0tQ6?h;n?`iBCrBM{a7kivwr^qqRGPCmH77N>Br`vck%3hMqK3J+ zG#ASAWMp8;P0Y+=WDwJc_Q^^tOVrOv%uCk~E-A{)OSjexV`ngDXRu&o;0n$!ElN&x z%LLge6jGF#8Voa752THUL6AX+kwFQ>h8W?QlardBnB!QKUYeVlSK?ZcoLT^J2M^e7 ziKPm8r8zkujh2iIaIvyXkUvdA@=J>qa#D*Git|g0bxS~gO)RZYNXgGEOU)}$NG!|G zEKB?cAiU+Dl$DxX z!pI!PK71{h^20c$tC$kmFx^Yj0|i( z`T5zU1&j!ovidC21PAdqhk!*TCzs_WadNFuz}RH zFf%Uy{{Ww)oEK7nJt0=4VA_h4vQC6cJ4D4E>EFfwT1G^}z8A}T*SW;A3E65M*Fw zkY`|LP+{O;&}QIduw>w3aAx3O@MPd+2x8!42xZ`BNMI0PC}rShsAdpiXkZX#XlD>% z=w;w#n9Lx~u#7>1L7ahsL4$#p?+=3j<6j0gMn)mdUkt2&7#JD z;{Re0VBiF0ZAcI@%wb?*U}a!naMs#q!)z-f4f4FDjGYWif*Fe_i}WG}F)dLRJuO+i zMGS1BEOsp{jLZMO(vs0LW6_e)lGXFqk`-m~Z((9w{{I-ldwLAq3=9m?49pBN3_J|7 z415f743Z4;3~CH=3_1*o42BF!4CV~V3^oih3{DKHVCM@nu>NIW1v!|Pkx>ZjU{MB6 zP)P)JX&eI+II@+QZM1xK_SrFm94NbpK}1KCMbC^?T9h@x2JE~y(rXwP7$5=7$G{8@ z8YTu!21N!fuuY;2O#d0U7+BdEI2l2hk%8d{gBSxRgA6$B2{SM-+Ay#)a4|42oDg8! z%fK1Q%(jOsl9|~*l7-Dbl9kmzIFbb{BEab%$-?d*$;#m$9LWk6V)u_^VeyY-W%Cb? zWCM!``1(h(2=MqvvI8Ag3J- zqAW&Mtdgu&Y?5sI%-EUDI7B%_*%vX$O0tP^=$UbDV&E3#+{M7dz_5*hw}k_gFgG!9 zZ)4yChsZue)W|WgGcYjdF_bZwF;p>_GxRZ7FzjZqWH`uR&TyQ;8XQ1&3@rZ{nm_?0 z$Ic+n&LGdo$iVQQL7ah;odGVw4&rfwWPUIx{Ab{1V1h_8FfcGPD1akCk-?LJfq{#G bk-?q8o56!Yl0lDwfq{d8kwKq n = len(tableau1) +La deuxième boucle parcour le tableau2 -> m = len(tableau2) +Ce qui donne (On*m) + +Function_2 : +Comme il s'agit d'une foncion while la complexité est de : 0(n) + + +Function_3 : +Comme il n'y a pas de boucle les instrucions vont être executée une fois donc ce qui donne une complexité de 0(1) + + +Ex3 : + +Sum = O(n) +selection = o(m²) +Tri = O(n²*m+n*m²) +total = O(n²*m+n*m²) \ No newline at end of file