From 66ddc416d89372ea06cfeababa74bdb80edf35ce Mon Sep 17 00:00:00 2001 From: Jossua Date: Wed, 15 Oct 2025 11:16:05 +0200 Subject: [PATCH] exo3 --- exo3$1.class | Bin 0 -> 787 bytes exo3.class | Bin 0 -> 2069 bytes exo3.java | 52 +++++++++++++++++++++++++++++++++++++++++++++++++++ exo3.pdf | 5 +++++ 4 files changed, 57 insertions(+) create mode 100644 exo3$1.class create mode 100644 exo3.class create mode 100644 exo3.java create mode 100644 exo3.pdf diff --git a/exo3$1.class b/exo3$1.class new file mode 100644 index 0000000000000000000000000000000000000000..ab8e4f6e3258aab61cb3bf2dfa0a4231ff78bb66 GIT binary patch literal 787 zcmX^0Z`VEs1_oCKT}}oj24;2!79Ivx1~x_pw$zGzV--V22ClNi9F^ky+}zY+Mh2#6 zPc8-y22OScE*=JM1|CKRfvm)`ME#t^ymWp4q^#8B5=I6#o6Nk-5<5l)W)00SE(SgZ zes%@{9tJ@MAw~v4gmTZklGOCnB1Q&|%)FAY#GKMpuntd<4iO#(Q3f$a2KMCq+=9fS zR7M6?4Np%^Pc8-~1__XyBqM{Sh7X2e)>wozJ=qzg85u;tic3o}bM&3Th9;Ke7lF); z_S6hxWMFa5Pf2BD;P=VQOZ6+wO-d~aNleN~Wn|zC&P>lsEGY#!LLJ#khk7r(9YLRnJVsUY5F@pjF69WeWBZCwJqksS?H83zRFf%YP za5Km-Ffqt7Ffb@FFflMOFfedwX>Vm<)Y{I#zL9}}fssLufq{XIfsuiML4ZM?fq{XE zfro*SL6kv~ff1}vkAWF%l9<*O21e~|47_?Eh7O3agF$!=ni;|Zjtrt;*MRI)h3e(i z(muezr*nXTZySR+x)uQjMFs{2P9~58z?c>44kZREBg2bX!Mg|EDO&_qv(vr*^eP^(6Vo83HH5UU9 z11~!R9}fdRg8X zk%3hs+EX)(ok5h5fhpRPi$R=0f}KH#U-h^j10{Ar6r6Eq7YYP=IaL(W#*LxmlUNY z=2~+wC^Is!>Vg0lgDQg>JA*n8g9d{pBZDwFAW)SvGO!nbH0R_oGKgwG41`!!Qk0pO zZVmF1IDfxGBSwgCT6EP=jSCSmV{@P zWH{&N6_+IDl@x=__Jl?RvgsfP8uKuifLzB4b_Ynr4CG!mP=HzRFjz8JF*0x`C*~xV z<^<>G=B7de){~3DhQXGd!44GV_KXaIV9$XK_slCvO;0TXDfINz^kigUan4UkWn|#@ z$;?ajE6q&;dm$&4k%2e3Br!SLH?bfjF)1gNoxz2XfjK%Fq$4*mGmnu$3?=S^VL`&k zAefVwo0O8M0t*in14agRjcCtkuzg&?`K3k4scxAdJ2*ixtp{=)BZGibett=DNl{{f zZ)!NN&l@E6dML)%O9r*f+H#F)cBpe8#f=Hvut zmZVzqvoXYQF~l;&u`|Sj5@!M_0&cMU~0&EP7pt6^Nk->q1 zfkBpmk%5tcfq_+PI|JiJ1_lO321f=429P2K24)5>P*#O1O=DnUU}IolP-eE#^3~aA z$85$T$|AdnK}1KCMbC^?T9h@xriF!Z`TsZ4YZw?9n7{^!F|dM62Wu5$U}unKU}I2Z z;AC)OU|mV^82MRa_T?P&Y zJq95LeFh~4Jq8U1Lk2wtT?P{dV{nKFFtGe#U}F5kz|Q!KLG~8|w*VKYG=e%rg@Fm2 zc6hXQFqmuaU@+goU=504 Integer.compare(calculSomme(val1), calculSomme(val2))); + + for (int[] val : tab) { + Arrays.sort(val); + } + + return tab; + } + + public static void main(String[] args) { + int[][] orginalTab = { + {0, 3, 2}, + {9, 4, 5}, + {4, 1, 3}, + }; + // int[][] orginalTab = { + // {7, 2, 9, 1}, + // {3, 8, 4}, + // {6, 1, 5, 2, 3}, + // {2, 9}, + // {4, 7, 1, 8}, + // }; + + afficherTab(orginalTab); + System.out.println("-----"); + + int[][] resultTab = trierTab(orginalTab); + + afficherTab(resultTab); + } + + private static void afficherTab(int[][] tab) { + for (int i = 0; i < tab.length; i++) { + for (int j = 0; j < tab[i].length; j++) { + System.out.print(tab[i][j] + " "); + } + System.out.println(); + } + } +} \ No newline at end of file diff --git a/exo3.pdf b/exo3.pdf new file mode 100644 index 0000000..1c06412 --- /dev/null +++ b/exo3.pdf @@ -0,0 +1,5 @@ +Complexité algorithmique de la fonction trierTab: +Ici il y a deux principales instructions qu'on va calculer, le tri par somme et le tri de chaque sous-tableau +Le tri O(N * M Log N) +Le tri de chaque sous tableau O(N * M Log M) +Donc le calcul total correspond à l'addition des deux : O(N * M Log N) + O(N * M Log M) \ No newline at end of file