From 1c132742faf856ce23523c005c0ed03ee062dcae Mon Sep 17 00:00:00 2001
From: ducreux <clemence.ducreux@etu.u-pec.fr>
Date: Wed, 15 Oct 2025 11:41:50 +0200
Subject: [PATCH] Ex2/Ex3

---
 Ex_2/Complexité.txt   |  14 ++++++++++
 Ex_3/Algorithme.class | Bin 0 -> 2002 bytes
 Ex_3/Algorithme.java  |  62 ++++++++++++++++++++++++++++++++++++++++++
 3 files changed, 76 insertions(+)
 create mode 100644 Ex_2/Complexité.txt
 create mode 100644 Ex_3/Algorithme.class
 create mode 100644 Ex_3/Algorithme.java

diff --git a/Ex_2/Complexité.txt b/Ex_2/Complexité.txt
new file mode 100644
index 0000000..6a545c2
--- /dev/null
+++ b/Ex_2/Complexité.txt
@@ -0,0 +1,14 @@
+Ex 2 - Calculs de complexité de fonctions
+
+function_1:
+Dans la premier fonction il y une boucle qui parcours le premier tableau (tableau1) = n.
+Ensuite il y une autre boucle qui parcour le deuxeime tableau (tableau2) = m.
+Ce qui donne la complexité suivante : O(nxm). 
+
+
+function_2:
+Comme il s'agit d'une simple boucle while la complexité de la function_2 est simplement O(n).
+
+
+function_3:
+Chacune des instructions ne se produise qu'une fois (pas de répétition, boucle) donc la complexité est de O(1).
\ No newline at end of file
diff --git a/Ex_3/Algorithme.class b/Ex_3/Algorithme.class
new file mode 100644
index 0000000000000000000000000000000000000000..407728056a2b4dd591bffbc1ac73d589dba0898c
GIT binary patch
literal 2002
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{jBLj<LPI^8g1Di&4v?oX*Z*WOsa<*?`0aTu|I5j6Vxg;|`kCA~@1EPkx
zxHK2a^JHXT$xY16V`LE1i1x`!EKAhSNz6;v4=yRn%uBb{3}a_7XJ@crWZ(+UFD*(=
zb;|@<$`7)%D6=FZH&qX$hlfFsL5Pt-3B-oz_sq#jO;5~mEJ`oUP0cHDtw>HSfH;B&
z?6AaAg}l<79FRs!Mh3W8StiJrCL#Hy#R@s8#R|pwrNz1>AfG0dRw$(8XO^Yrl_(^Z
z<!2Tt<RmKO9$uB3s!)=cnUj;s!yv^V&BGwUAj!zU6z$2wAj%-d&S1sEV9j8|$ROa9
zpI=g3Qj}QWn_7~QpHj@v#$e0AV8_E?&)~q$;K;+^#9+z8;0*Ex7s7Xp3<3y0`6p$i
zCYLZW2xAE-Mh52SXir84Q4MT?h+<4|WpPPrE+YeTerX9KgD6COX1;zvQD$CAa7j^W
zVy-n8gA0QzBLfqo0waTXZen(-bADcOVo7*rNrrQNUU5lcUP&>?GEYs2cH}r?WDo|s
z8P!Ne2G#<Q1&j>rU^*v{oxu&{doM-?6|j1+8JT%y`Pr$^=!aP9mY7_UUsTD?;KRtk
z=98bFU0T4%z~h;hms;eUlUQ7wTFl5W1KHb9Gav!&k(if~lUl3-(P)k7TqF?`jUkl<
zsaTXFhdm@htdYY2YJ_uQPEK%UNvbtFgD)e4Du(~Cxs8!Q4!=4EMFxHb0R|9YWncs)
zc?L!XVFm^USq4T1Mg|53R;}#}j2jsk7#JBu7#JAXz=A9coS>u#QOan_z{0@Bz`(Fv
z>o^1NZU&}EA?EE2Ec><g*+|cV3b29&n2q+?GTX^YFJe&Ck~KQUz^x@~v`=O}R1F(Q
zO$#&Q^8XJ&ida$>F}TQ@vB<I{n6ZkoN-tuN(-LJh+QGoCCCUP#7BR4kvYN59ure<H
z|42*L$cj}<79<s{CCVbn8VojRH^`(#4E$QMMmrcdz(Suuo?!xe#t-aMHU>Thb_PKP
z4hDG!E(R3_ZU$`z9tKMWUIu3dZU#>V0frz3L55HUA%+A7VTMu$A%<!OQHBNvF@|;q
zafV(70fxy8QVh!&q#48+7#K7dc=`S?2r&L-U}Izy;{3(H`iFs$@h<}(Bcs$W2G*Yp
z;voJn1_1_6P`-u)A;TO776w)Z1_o!XeKyRtGSVQ=TguqUuq2qVh_Xm8Vi403Wzo};
z)my~CCdy*h!os-x|0^vSJu?<987)~oe=S*27XKC|#^wKyA-t!@z|FwGAjiPWAkV<V
zpuoV#pvWM}pv0iYpva)Zpu%9tpvqv*pvGXsAkW~$paFKiFazsf23C-Rc^Mgnzz!B=
z-~<&zP?yFrFo7dmnb}6mS7)CcGsuCmix@<7L|OFASfxc-6KufFdn3Jufq?-M(0mNc
z3=9m~3``6<42lf8V4Fl4nEo?xF|e{Ta5920BLl+^1~CRs1{rYL6J}sw)Mj93;9_84
z*v_$+fisesZ4Xx@GqZmr3!8r=E31ESBnwzXfYU#ch21}rmBT+ck`*k(?jOm*;vdP%
z<{uo%1{M+U^^ar`;PH=S6|nFRj%0@jvO#qUaQX-PXzyU)(nj`@la45hkrk^Xs}-9h
z+deaPW-|^^4pH_+46>4Jq8xf=oSPW9MLBmd@GvlJW8iJ!0HwoC4BXoo_`m_M4-pe`
z4D6s9ks+1Af+3T^lA)HtieVLlHNyr5ONMO>w&3uvV_^BuPzVYSId%qlb_RJyMh1re
z4B`x&><n-bb`XyfB=dto;Xea60~17&fq{XUK>-}ziVU6%3=CWhj12A!-V7cLk_>tb
P3=A9$j12k=j0^?<Pu{j$

literal 0
HcmV?d00001

diff --git a/Ex_3/Algorithme.java b/Ex_3/Algorithme.java
new file mode 100644
index 0000000..589ecd6
--- /dev/null
+++ b/Ex_3/Algorithme.java
@@ -0,0 +1,62 @@
+import java.util.*;
+import java.util.stream.Collectors;
+
+public class Algorithme {
+    public static void Algo(int[][] a) {
+        if (a == null) throw new IllegalArgumentException("Tableau null");
+        int n = a.length;
+        if (n == 0) throw new IllegalArgumentException("Tableau vide");
+
+        int m = a[0].length;
+        for (int i = 0; i < n; i++) {
+            if (a[i] == null || a[i].length != m)
+                throw new IllegalArgumentException("Tous les sous-tableaux doivent avoir la même taille");
+        }
+
+        for (int i = 0; i < n - 1; i++) {
+            int min = i;
+            for (int j = i + 1; j < n; j++) {
+                if (sum(a[j]) < sum(a[min])) min = j;
+            }
+            int[] tmp = a[i];
+            a[i] = a[min];
+            a[min] = tmp;
+        }
+
+        for (int i = 0; i < n; i++) selection(a[i]);
+    }
+
+    public static void selection(int[] arr) {
+        int n = arr.length;
+        for (int i = 0; i < n - 1; i++) {
+            int min = i;
+            for (int j = i + 1; j < n; j++) {
+                if (arr[j] < arr[min]) min = j;
+            }
+            int tmp = arr[i];
+            arr[i] = arr[min];
+            arr[min] = tmp;
+        }
+    }
+
+    public static int sum(int[] arr) {
+        int s = 0;
+        for (int x : arr) s += x;
+        return s;
+    }
+
+    public static void main(String[] args) {
+        int[][] t = {
+            {0, 3, 2},
+            {9, 4, 5},
+            {4, 1, 3},
+            {77, 12, 56},
+            {6, 4, 9}
+        };
+        Algo(t);
+        for (int[] r : t) {
+            for (int x : r) System.out.print(x + " ");
+            System.out.println();
+        }
+    }
+}
\ No newline at end of file