From 796dec1af723c352ef9eb9c5faf837e0ec58f980 Mon Sep 17 00:00:00 2001
From: Wander_Lust <hvmanoj2@gmail.com>
Date: Mon, 18 May 2026 20:03:32 +0530
Subject: [PATCH] alr

---
 .gitignore            |   3 ++
 floydWarshall.java    |   1 +
 galeShapley.class     | Bin 0 -> 2643 bytes
 galeShapley.java      | 118 ++++++++++++++++++++++++++++++++++++++++++
 horsePool.class       | Bin 0 -> 2342 bytes
 horsePool.java        |  50 ++++++++++++++++++
 kruskalMST$Edge.class | Bin 0 -> 691 bytes
 kruskalMST.class      | Bin 0 -> 2434 bytes
 kruskalMST.java       |  81 +++++++++++++++++++++++++++++
 mergeSort.class       | Bin 0 -> 1763 bytes
 mergeSort.java        |  53 +++++++++++++++++++
 primMST.class         | Bin 0 -> 1962 bytes
 primMST.java          |  58 +++++++++++++++++++++
 quickSort.class       | Bin 0 -> 1843 bytes
 quickSort.java        |  57 ++++++++++++++++++++
 topologicalSort.class | Bin 0 -> 2280 bytes
 topologicalSort.java  |  53 +++++++++++++++++++
 17 files changed, 474 insertions(+)
 create mode 100644 .gitignore
 create mode 100644 floydWarshall.java
 create mode 100644 galeShapley.class
 create mode 100644 galeShapley.java
 create mode 100644 horsePool.class
 create mode 100644 horsePool.java
 create mode 100644 kruskalMST$Edge.class
 create mode 100644 kruskalMST.class
 create mode 100644 kruskalMST.java
 create mode 100644 mergeSort.class
 create mode 100644 mergeSort.java
 create mode 100644 primMST.class
 create mode 100644 primMST.java
 create mode 100644 quickSort.class
 create mode 100644 quickSort.java
 create mode 100644 topologicalSort.class
 create mode 100644 topologicalSort.java

diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..aad2d55
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,3 @@
+*.class
+mergeSort.java
+kruskal.java
diff --git a/floydWarshall.java b/floydWarshall.java
new file mode 100644
index 0000000..017d7d3
--- /dev/null
+++ b/floydWarshall.java
@@ -0,0 +1 @@
+import java.util.*;
diff --git a/galeShapley.class b/galeShapley.class
new file mode 100644
index 0000000000000000000000000000000000000000..db0b8dbba2ad3f347b0edb2e9417b74b0e641879
GIT binary patch
literal 2643
zcmaJ@OH&kA7(G4H(>;uBM6i9MBfe%}fQUL8Fe;9(i9C#qprDavXrX1MdotaqXx>E@
zsZ<uRvWOeYvXZh=Wu??qAu*3tl0_=3Y_f<}7RjH8WkSyF85IRnz<qr8yWe-ebI!fZ
z&;Q>29zYx3jv#=b3Ry!4iiFBD##y5&XV}9{U4v)LtS3R)VcC|qQ$jEn@2Nl-6)GYc
z=0TG%Z`jD0-6KXJXO2sdI{BB5-~}vDQK?}esvbog^Q>G`Td`=2yAtHnRxZcDvHo;A
z-Xr`M31{6m_4Nr;7)vxP#WD$Mp=h2qi`-Tb>*oe;>8rpBtW;5>VHH+CO5q>6d))QR
zJkRQk@#uQHUykK89WGk7*X<QeBi|av8VO4y-JUU+GoyLK%Z^y~aI|Q;V>z!Sg0)zu
zV!eh9*eIcTjtKst7%yitMXZ#gl-*;R;nsLh6~T>bs6)MkC3$1iOgVPe@Omw8gd^88
zY>x#kj-^uZ+1ph#NLc9S^<nGI8n$f~MbS+fUc@E|0ZXKQTwU5Oj6JF@f&?}THn*_I
z^5F=;OqY017)c2$_Sv3UjM`)QL3YmRXu+_GZZu}cTcQGm?HXPZ5QGW>JQ255!w$U6
z@@@0Hm$r#8HIY`aivw~KMw^6Hky6+W)86Pt5BubqcGirxTdwD}R6#;YAhTCsH&^*0
z(S8jFaF9w7i6ktF%>h#cui%i1b`2e%@Mb8NJd*~hDLY~m+qhqjrQ<0fs>2#y#SuE6
zbMl6r;&R4G+e7Ag;ggE9f{cV{xq@CN|GXLk@Wb_LI3~iq@N_VdsZT=${bkV-8zJfh
zPHK2fT(eL%=eQ=5rko*m3)(H)?DToa2vJIyPjzNTJB)%qSCJ*>{Y08ef&M;j%o{=i
zi(~z>^%L(=VNtnrEJ=uTJ7dMHx!)35Dra2ZMj<$w_Bf8`dPSqqVR|FZkQ)Z`)DR29
zj!IF>EnOIMD0+@!j&=xZ7zL8~glboa$zN#+qsSZZ%u+d6%K`<I)fmpII42}Q7S{Q)
z_b-!WpLIsfrV^Q@`?KH3dQOoq&8IVOUD>g8-h+lclr!CR?T#}#R%o4#&J4>_8#Cht
za}M{JAeLUl)|px?he#Q@T({+!trE1fxU8w1;ku@);-ZB0vuc{_s4Cv%<@tYCO1e}R
z)=**rJ~9$}zQi0U9P<fhdy2Cf_7eM0-5p4`e8&N{Vi^c>6R*Kz*Fed2d1dd=jb~iL
zbfv^+ySB}8)#%C>yX>0d@j?t%A56-+d>iUDtf^bktjmonuOcMhD2;144&IoMrR&r8
zgCchT18i48Wn0P0_*Fm^mS7Pp*7+t?BF>q?)p?K~A}CeQd%!$laoI|lrJI~r(BUs8
z{Wj7eTDj97x5$aW6y`U`Q>dmP8PY>n@KGSC1e2<+(sB*84Z6DdGW2D#t~UCXh^{7;
z>!_GedB}UZ61WOZd+T+jnNCV$V^S6UiAH&#E5S`%U&LNlx*BvPn3)JoU&jWqkPO!e
zvmTzp;>)O>;nSdp<;?YI?>3fKMJG`kOe(rkIu1>hy}B}Rsj@A>WCNG(A_mZBLJ`Li
z%$6W~4^fU+lHnT4VHK)5UrNww2wE-HV<Ug+2;Nq<2T+ege2qFe&+voNhfO$%&9JZq
zMI><n+wcyy<9)vWAM(Zj7&~zVyYLxy;|u=N@Fn)*7WU(79K;Vu<39U88BNgAjL0+-
zDk^sRzk@1<R18YMKZr<Dlx&3`@&orbY6A~xdBD$X1x{nQ%-#gmDagO~4HCz1qwx-!
z+XXILC$X)55-ndr5XIjgu`?jZEf2}?@~YiFc#rhfCctacWdYhAAGDyLoExrTHDm1y
zP9mLD61v>1hje8MU0o9)qWXug$L~bI?%4r*O978QKVZY-fIUwIY)DMuIP;!(!rCA?
z0*+A388UVh%h5}&j`^Hy#|fnPxybNJoFcXs2KiPF;3Dns60r|3f=_S;pCgBx$m1?-
z{KWAuwEs#Te}jkLxkIqhi10L85mGUtB2nUolsv==60nw>2r8b;$iW%z3SgA+z{?ke
XOMdcx>-g>K80Sia)(dz8Z(-SgVW?Mc

literal 0
HcmV?d00001

diff --git a/galeShapley.java b/galeShapley.java
new file mode 100644
index 0000000..ddf6854
--- /dev/null
+++ b/galeShapley.java
@@ -0,0 +1,118 @@
+import java.util.*;
+
+public class galeShapley {
+
+    static int N;
+
+    static int womanCharToIndex(char ch) {
+        return ch - 'W';
+    }
+
+    static int manCharToIndex(char ch) {
+        return ch - 'A';
+    }
+
+    static boolean prefers(int[][] womenPref, int w, int m, int m1) {
+        for (int i = 0; i < N; i++) {
+            if (womenPref[w][i] == m)
+                return true;
+
+            if (womenPref[w][i] == m1)
+                return false;
+        }
+        return false;
+    }
+
+    static void galeShapley(int[][] womenPref, int[][] menPref) {
+
+        int[] womenPartner = new int[N];
+        boolean[] menFree = new boolean[N];
+        int[] nextProposal = new int[N];
+
+        Arrays.fill(womenPartner, -1);
+        Arrays.fill(menFree, true);
+
+        int freeCount = N;
+
+        while (freeCount > 0) {
+
+            int m = -1;
+
+            for (int i = 0; i < N; i++) {
+                if (menFree[i] && nextProposal[i] < N) {
+                    m = i;
+                    break;
+                }
+            }
+
+            if (m == -1)
+                break;
+
+            int w = menPref[m][nextProposal[m]];
+            nextProposal[m]++;
+
+            if (womenPartner[w] == -1) {
+                womenPartner[w] = m;
+                menFree[m] = false;
+                freeCount--;
+            } else {
+
+                int m1 = womenPartner[w];
+
+                if (prefers(womenPref, w, m, m1)) {
+                    womenPartner[w] = m;
+                    menFree[m] = false;
+                    menFree[m1] = true;
+                }
+            }
+        }
+
+        System.out.println("\nStable matching result:");
+
+        for (int i = 0; i < N; i++) {
+            System.out.println(
+                "Woman " + (char)('W' + i) +
+                " is matched with Man " + (char)('A' + womenPartner[i])
+            );
+        }
+    }
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter number of pairs (n): ");
+        N = sc.nextInt();
+
+        int[][] menPref = new int[N][N];
+        int[][] womenPref = new int[N][N];
+
+        System.out.println("\nEnter Men's Preference Lists:");
+
+        for (int i = 0; i < N; i++) {
+
+            System.out.println("Preferences of Man " + (char)('A' + i) + ":");
+
+            for (int j = 0; j < N; j++) {
+                char ch = sc.next().charAt(0);
+                menPref[i][j] = womanCharToIndex(ch);
+            }
+        }
+
+        System.out.println("\nEnter Women's Preference Lists:");
+
+        for (int i = 0; i < N; i++) {
+
+            System.out.println("Preferences of Woman " + (char)('W' + i) + ":");
+
+            for (int j = 0; j < N; j++) {
+                char ch = sc.next().charAt(0);
+                womenPref[i][j] = manCharToIndex(ch);
+            }
+        }
+
+        galeShapley(womenPref, menPref);
+
+        sc.close();
+    }
+}
diff --git a/horsePool.class b/horsePool.class
new file mode 100644
index 0000000000000000000000000000000000000000..111de49c17e6bb5b61c7f424c75e7fc37841da36
GIT binary patch
literal 2342
zcmaJ?T~iZR7=AWv*br8UK>Ui4AXoz^sBNj0XvO%Imai5?QQNX42ePp2rn?)e{kZcN
z^s0At>;*F&dr>=sj?Q#?)0_T-UUvE~97p<`YywMVI)puY&Uw%KKF{;M@7X_JKmQHD
zD87v&f+h{BjwqTHB$kX-W5_b>#i7ahB~kPhH0Mm)^v^43%J$8)AchtVaUHGD6||Hc
z*Ar8YV=0JwWpjb{9b+{gRo}FRt{Gl=+^CGiu^Vj~5<2#vohDmR@@2y{ioS3aXsd=*
z6_X1J_Gj~bftMPRO&j{@L{h_E9s96<8`^2#HSI;BwS>LsmuqMXaU4WS!yy?qtzgeq
z*n;hgMHzH&wh#_gUuU2$WHfZ^ID($W$uK1bs8q@JOg02GkZk15m2il<k)(1|$6Gi?
z&_${+N^dIB<YnwW9sM$}z9{@j_mWsJs+KS59M^F|QjeLoKO^<hFtiQdbkVSF;kMuu
zPHT8u$2)j;yHfW(U#uvIn6`psfYo${3O4yrMPaOv{UF|x6>&!9Vn-8M3a4;Z#|U!N
z!jW2RIh$fK8qQ*1?d*zQrs8hK7x(<LnK&+BRKrCbd0c9g12Ke-v7Rc@3B86D4$?f*
zHzOfl(Qy^msD(|hW2P+>bY{a+*R7@0AL{r>+P3=6jY>thdBYPij8mET<q3(bV)z_v
z2`+|79a9onyjIiKjd@GR<xg}><2v)@3BxV2$d2uREtLHR+Cn><ZAQmU+)}V_#aI@3
z$1WQFP17&)&GQZ0_axJ8wYZ7?0&eTLBk^c8O)NWxPnq<o0CL85{LF$=wM$Zz&vnen
zPL38W$0O=4G_g;o%|+Yrt1cxv7XS<wb1sB=tJy+}jkY*H!WzvxCAw*of=^Ue=7n3+
zhdG}1jp8!fy*^i03|V4(vv)$C8j{RtSYqaP*kV3&MXP@2#HXFATNGDJiy?P!-Zq1>
zlbO4Vj^lg2YgERCUv^4f3>8*vLzkK+8N<(*c1hgJC~eJf<M7~XsLEulD(Kz15=?v5
zSr$V9z#u<Ycr!WfeFfi#^ISI!LS8fMk|n&}F~?c1R>G}cXBy(Z?cnwM6|sYPSdjWn
z5w7UEi@af3)21(&4!t1TJ#QJFCp--Vd-M%XJ3-a(wSvR{Z^}v!c%hrsA7K$QIr8S`
zIL}!GMP3rDH8k^C;!2vM!ZF(a6v{8P1A<SvEzM)Ht?H&fL#??iCPs6q#O)uEegZA^
z47>W*(eVri)^Ye|N}c;Ix3=*QcM_THTTQu?G*nBE(8KNi)H-_W7HTO~syld~C~F&k
zNgxqOAV&y+=+Ht)DULnRFwC`!T)E3}9&s$tA_4Uk8|NjuUZImiANSb$b?AQ(dNZw-
zB!Y7Te4J0KrC~Lx9(shCrr~HZntp_?0WKz^B?9YDs=>=cv^<Cs(%-arh<H*>m(;n(
zNmVjPssV*`4SV)?99+l1+_1W~@l)h6qXi63Q+;3;vF|3<1lss*OQIe7(ZQ>}6KDBp
zyujI2ek=qzmT{=YXb+;V(WWTME5wv;{UtJ_yvXe!anI32m%!``49-5m$)^||dxH1d
z&#mJF61=>Q!nmA|ZOtc6Jj29sK0cPrBR`;n21)ffZUF0;T|=upaF?%i@Yz-l0tQ{I
zqYN>36JrnmdNII{;Si27A6ew6_!y2;@j=|e$r^)wh-`2%s=?GSsG*ZTmX*fTEN>QI
uPpzha))(lSeG21OX#Xw4CQ`L(dal6c7^4JV@ZZ6goW=Qe4`1OM9QYSm_%&Go

literal 0
HcmV?d00001

diff --git a/horsePool.java b/horsePool.java
new file mode 100644
index 0000000..3981d8b
--- /dev/null
+++ b/horsePool.java
@@ -0,0 +1,50 @@
+import java.util.*;
+public class horsePool{
+    static HashMap<Character, Integer> shift = new HashMap<>();
+    static void shiftTable(String pattern){
+        for(char ch = 'A'; ch<='Z';ch++)
+            shift.put(ch, pattern.length());
+        shift.put(' ', pattern.length());
+        for(int i =0;i<pattern.length()-1;i++)
+            shift.put(pattern.charAt(i), pattern.length()-1-i);
+    }
+
+    static int search(String text, String pattern){
+        int n = text.length();
+        int m = pattern.length();
+
+        int i = m-1;
+        while(i<n){
+            int k = 0;
+            while(k<m && pattern.charAt(m-1-k)== text.charAt(i-k)){
+                k++;
+                
+            }
+            if(k==m){
+                return i-m+1;
+            }
+            i+=shift.getOrDefault(text.charAt(i), m);
+        }
+        return -1;
+    }
+    public static void main(String[] args){
+        Scanner sc = new Scanner(System.in);
+        System.out.print("\nEnter text: ");
+        String text = sc.nextLine().toUpperCase();
+
+        System.out.print("\nENter pattern: ");
+        String pattern = sc.nextLine().toUpperCase();
+
+        shiftTable(pattern);
+        int pos = search(text, pattern);
+        if(pos!=-1){
+            System.out.println("Pattern found at index "+ pos);
+
+        }else{
+            System.out.println("Pattern not found");
+        }
+        sc.close();
+
+    }
+
+}
diff --git a/kruskalMST$Edge.class b/kruskalMST$Edge.class
new file mode 100644
index 0000000000000000000000000000000000000000..1c6429d67a0f1a49d1d934f8f8fde0cb2e73fba1
GIT binary patch
literal 691
zcmZXRT~8B16o%hvxBJCPS1F);sC=mHlE@EeLqZx1n-nx@!~L|Kl!bQJ><9iSZ%nKv
zUJ$PRQHFO4u>>w=&YYR&ob#SDfB*ft25^WEE=nj{Fg#RX3iucDO74$kJlg-<zfgl*
zz-&cvlphF`>y0x9HXIAChXr^7)yuTVF6H>7+uJ=Fj+B5XxI&FBdZ=nfTxsvQhZov2
zzo}?+p1ZuNd057ZfHO!YUuCL#i9oI1d6cr*2razi%UoG|#>@Vg^~`!0hK(};qn!-t
zS36OxPK!xjrM)|1x!#$F-ZjOXZ1qIt=gIJkOyxx7D$S^*8;xR_7bz1ppGG~nnM-Ir
z5q!`TaJxy74%DYeYkV-Jk6Ma=eX6qjILUGgyM*U03wU81tF%3qS*9q-&|}40j;jQL
zRh0Q{96fjF@y;v<ORHZhctvWBrxtmGwif(`2-c^tf{iJj1)Ed&KX@;&&V7XuI?8|v
z2No7tX9+G}`7`&Kwwb9!$_;+P-{Ts7{~vFX0X+YZ{01pqdF!5cg1sBqzp(TeFJqHf
eg^@m3`8Ayq-mph)x3E34J9tN{mDt$9d)T+zl7H*~

literal 0
HcmV?d00001

diff --git a/kruskalMST.class b/kruskalMST.class
new file mode 100644
index 0000000000000000000000000000000000000000..b45075b73a850920eeb384322a8ec9b5a6890ec5
GIT binary patch
literal 2434
zcmaJ?OH&kA7(EweriZ5GJtzp;Dn>?m_?#$%C?dvD9-2W6l84REK+8-wneHKy_k+B5
zS)_EMsbpcLDw~j$D5g@TQpqBVY_iTjNGi)z8KXJ3XDFbwQZ;k$cklhabI<p>{mX-;
z?*Vk<V--axRuIq-L`b0Gk}+$vrwx0ueQ@lOneqfeotABRT>{0;(cuz=QKCTAPzp^z
zozCXmX(QdA9HQckku_~v6pbcS>Xm6IM}<IO!m`IXH7BA81yur-{v|ojO1CFdhHabK
z64W4~pjN|rY*@o0Ip=z2hM1Nu5b5(REvG$U&*Z$Mmo<${Tty}7CI5{A8=4=hB8k_a
zQNt!|rXx;{ELXtJWG#CcEQ~Dz^}Pe0nbqxFW{i_Fq0gFG&q|qYhpu89niOo;@C0@U
zR4)@+g&`1}k%+vaz{Za!*;@8wJUT4-Mm6ljE&;_hFMA28%jhyXtrSK_6JfLq>`;4c
zNy8YwWTZ?xHK%6`Vq9+Cty>ei?dazCq#4aq+M{8w<fHgEr)>rMm&y5Y?#^b7xjxJF
zRP2-aeo~-(C3j7|L{bsMAsNOFrm{JaNJNKA(TT$fx-=ZYQGv3Ryh$ihHO86PHD2bc
zCLX<@;uv}q9M{l`6I5EU?Qzm+R+i=1E~~<IvP7ybM9L>C!5OD8PV!Dwa&vXd)>&j7
zlF=y*r_m=6wiq45bFu=p&Cz_`efvaVKVFIf3@SLI;VhmOs9NE$tip&*8SVg+;Ah~1
zv>4KG4#T7-b0bi*jJ>KW;w22$Ga5#4K|tjAPsp8TH9Y6<%*xdZ8ZOFJ=q1ydobsyJ
zaAO)$V93^IjA^sSu~UY3-twj>xt?KrjK_LE@_A=gmyK+w2@R8&VtM6k29Gm!qr+7Y
zxFm6>WhxSdK&-W`L`H)x8$6gwJFZFRdYo}i<$acI4)}FGWQ?V`vo7fwsp)=WrmzlV
z4B2|M&7+T!iViEF^VN?z;@gmPa@mx5!jh<~imgp%L7;TNbiIC4b{O5RIOaH>>t&6Z
ze$$(B#@#Sp5hxLQt1k2oU4-!(IjElF8EHMk2Pu=w=qbnbcvc?58!Fz!TMFKmad=0d
z$<MSO1IwOurp@+z_vJ%=!bq`d<^-;+?$3f^{{EAOJ)Sn*ras4+&dtOhb$!*&8pENv
z8S^pft0T1BB9B7!80mD9RUH@567pT_NgJ+f$~KW*px}Lh?T@(jIK~P-6xj6ts;tbs
zd)UI_Dq?xEr{ud%DL|PY1da|@jhqGN;Lb&euYJWCj`A2Z49j=EpxW!30u2jL>f7qC
zqe2S);uh8o`odSfl|(2*F~=&Dpc=J&p<m>x7^0Sttn>op0d56&P+3oe!y7qt5vH+W
zaD_>gudsoX>!4yI*)$L{3pWo@bQTI7gBZSp%8><BFQTq*0S#69O>EtD6U~Pk8h%1c
z(SY1*yNTV!u|Ooy@Hw^>$AXa{g__n#U~eQSbqD8z;>N>2<^vpmzk_`vi#X5`SXMj|
z2?j34LXi-ST3aK*y^&DcRW#NG?jSZ22}VMNy+s_njd&5x&xeTfn~(WJUEmhF8@^M&
zfwGKONmpqW%-{MKw~J#TN%JYvtP9*mLZCybQ*NVQ;3_7hloYs&SVy=n{4LHiT(J@<
zjY>(4ltk3)=p=%F>L1AA`6U<tF(W~Ld6AA&^%hJLq&I=_&k(x7-@{L78woDKlIk*g
zX_<#2$b4SI4vw1`>&?uljt$sKsfoMWv72AaLzIqlKE?GJegQ|Y3u9>E)6|N~Xu~Iz
zuW;`g_TUSCslLR1EZ_i^IN!xV{78hK5y!9m4E%}1_#0h9;0T|Gqhc$%MGKCJedrM}
z^olNicDfm!<2WVG;<Px&8)bd<qU<5B4l3{zR0;(xtm69!i+iZOhv2^`RnRH!qf|t>
z<nKP#@vQm*Y6Z0i{(*Im?glXHyZsW0=ldmwIZ9<bd!1$XvOm6xdG1wlFUFdFm;d+h
I0X{<Ae?mJmOaK4?

literal 0
HcmV?d00001

diff --git a/kruskalMST.java b/kruskalMST.java
new file mode 100644
index 0000000..d76e54f
--- /dev/null
+++ b/kruskalMST.java
@@ -0,0 +1,81 @@
+import java.util.*;
+public class kruskalMST{
+    static class Edge implements Comparable<Edge>{
+        int u,v,weight;
+        Edge(int u, int v, int weight){
+            this.u=u;
+            this.v = v;
+            this.weight = weight;
+
+        }
+        public int compareTo(Edge other){
+            return this.weight-other.weight;
+        }
+    }
+    static int[] parent;
+
+    static int find(int x){
+        if(parent[x]!=x)
+            parent[x] = find(parent[x]);
+        return parent[x];
+    }
+
+    static void union(int x, int y){
+       int  rootX = find(x);
+        int rootY = find(y);
+
+        parent[rootY]= rootX;
+    }
+    public static void main(String[] args){
+        Scanner sc = new Scanner(System.in);
+        System.out.print("ENter number of vertices: ");
+        int N  = sc.nextInt();
+
+        int[][] graph = new int[N][N];
+
+        System.out.println("\nEnter adjacency matrix(0 if no edge): ");
+        for(int i =0;i<N;i++){
+            for(int j =0;j<N;j++){
+                graph[i][j] = sc.nextInt();
+            }
+        }
+        List<Edge> edges = new ArrayList<>();
+        for(int i =0;i<N;i++){
+            for(int j =i+1;j<N;j++){
+                if(graph[i][j]!=0)
+                    edges.add(new Edge(i,j,graph[i][j]));
+            }
+        }
+        Collections.sort(edges);
+
+        parent = new int[N];
+        for(int i = 0;i<N;i++){
+            parent[i]= i;
+
+        }
+        int totalCost = 0;
+        int edgeCount = 0;
+
+        System.out.println("\nEdges in MST:");
+        for(Edge e : edges){
+            int rootU = find(e.u);
+            int rootV = find(e.v);
+            if(rootU!=rootV){
+                System.out.println(e.u+" - "+e.v+" : "+e.weight);
+                totalCost+=e.weight;
+                union(rootU,rootV);
+                edgeCount++;
+
+                if(edgeCount == N-1)
+                    break;
+
+            }
+        }
+        System.out.print("\ntotal minimum cost: "+totalCost);
+        sc.close();
+        
+
+
+
+    }
+}
diff --git a/mergeSort.class b/mergeSort.class
new file mode 100644
index 0000000000000000000000000000000000000000..9bb3d31ebd72ed41dff06ad6d15640af9ef09cba
GIT binary patch
literal 1763
zcmaJ>O-~zF6g>~dp21A`FiiNcNlXgG7_if%byJ+s1`-;#2GSZ)Rj4h4JtY(D8Ot7{
zu<C|ISM9dzuwdORNJXoztNw)kf=ZFvO&3)Zg`PJy!4asE{qCFl&b{y4bKiTvzdZUC
zz-_FC(1vyuijDw+0zD7S9WzxjovqZ$=0mIC2?TH2j_u6}w8tmcLeS8mBBUdPPJxcH
zRo$}kZk4!>_<A;*UC%Z^7j$%?TOi;g1Va9*zpSEHpx581?%AbOzF<0zRqa3@`c)V@
zE@I#{Ci&f(XO#uoY)8Pz`H{Ap$~u+0m-nicS<ZyegCSYNu)tvaT*%~_+##xC1eaKh
zTPNq!WcRDKbCOI$Oknt~<5|_1Q!j7QxL?Ptl2x`GuQnSC;R@bRF{Wc2ZwmCC5NgT6
z!YeW(w`j8QH6>fy*~&<XdJxw!iG+aaSdYA{#8TmGn0=YnF@vPQK-t{37F?%bdY{?e
z1I}umNeVJ+cCt}rYhFq0s*blLE7jk><Y>4q&=rzBvWhXYS~YiP!w{I36w*50m2D3c
zN^Z>(P!`-GO?S?AtYyFQRdcgM&xO2a7PgnnO7mMOo3a@f<LhTxOs=Wmap^l}NyP_j
z<9e3oA@A0!1#8ik*}GmHqomZ5&7XH&ujW<F%97<haEmn!cLl<YmWY;CX!wu`MXWoB
zYzQCWV--0m-jcwW-xgmU+u3oqtyDw(hMtRN!E>v-0zb6&rwMFqde3x<C95`;bKUKF
zC3CjW7SC&etGgBJ9C)i9jmwp3?O`*;f>|o%ZO_UG=vjF$7D{HVX4O>O7Z^WN(|J@?
zd@6A1|Dn9sjk++(E8WIJ2Pixid<8h(;MWMPpbaFRLj1^yz<V6!G8mxA`^~w8{>#t~
z+V3OjKvdaC2P0|K2t@aB!w8P-<66Q9Bojt3xesGVG1NU((6bj1$(4iSKVEr)dqLmx
zn;&`>`OHst>Oa9hi=;I}<38bpp)s45T-npa!SP>`bem6lj#OoR?W|8@37s4VNcjq%
zvA3aPk?T3$hcD5KBEr}~KfZy1Z)v|Ha+cA3P+#)R6C&O_Fz|wh?l~7V`3^Q!_=3p;
z1jZxL#~6=BHUg!zl86|}%ui4ghN5gl{TV%SqMy<mCM95q(ZeJYVcsY%u>ljf>~Gx;
zF+sK&+-z?34{MPjyFa7n^Ct*D#bE9UBH_!27@a!A#I5Krp=JJO6?&sbm;w%wYEK6!
z?PK)L7y*e|VG9n9|DI`&D#am%BxQ<gEx<uKh)o_*BqkX3@qaS(om1}flnoTJ6JwNU
z9D`&XMV!Yf!FxD`G^Q~}dk0A@BZW0w#aDcy99j?8@rb#lyrWQ#=?bd2rJ_fuc%MHW
pwdd%2fqsfT%<kPLunqHApzY%99`(56kBdwWHbY<qpCFH+{{TZAg$V!v

literal 0
HcmV?d00001

diff --git a/mergeSort.java b/mergeSort.java
new file mode 100644
index 0000000..cffe967
--- /dev/null
+++ b/mergeSort.java
@@ -0,0 +1,53 @@
+import java.util.*;
+public class mergeSort{
+    static void merge(int arr[], int left, int mid, int right, int temp[]){
+        int i = left;
+        int j = mid+1;
+        int k = left;
+
+        while(i<=mid && j<=right){
+            if(arr[i]<=arr[j]){
+                temp[k++] = arr[i++];
+            }else{
+                temp[k++] = arr[j++];
+            }
+        }
+        while(i<=mid)
+            temp[k++] = arr[i++];
+        while(j<=right)
+            temp[k++] = arr[j++];
+
+        for(int x = left;x<=right;x++){
+            arr[x] = temp[x];
+        }
+    }
+    static void mergeSort(int arr[], int left, int right, int temp[]){
+        if(left<right){
+            int mid = (right+left)/2;
+            mergeSort(arr, left, mid, temp);
+            mergeSort(arr, mid+1, right, temp);
+            merge(arr, left, mid, right, temp);
+        }
+    }
+
+    public static void main(String[] args){
+        Scanner sc =  new Scanner(System.in);
+
+        System.out.print("Enter number of elements: ");
+        int n= sc.nextInt();
+
+        int arr[] = new int[n];
+        int temp[] = new int[n];
+
+        System.out.println("Enter "+n+" elements: ");
+        for(int i =0;i<n;i++){
+            arr[i] = sc.nextInt();
+        }
+        mergeSort(arr,0,n-1,temp);
+        System.out.println("\nSorted array:");
+        for(int i =0;i<n;i++){
+            System.out.print(arr[i]+ " ");
+        }
+        sc.close();
+    }
+}
diff --git a/primMST.class b/primMST.class
new file mode 100644
index 0000000000000000000000000000000000000000..14daf458cd2d0a94198495337ec52464d52de7e8
GIT binary patch
literal 1962
zcmaJ?&u<e~5dNOM_Bv)sz+n?Y6S_bEI|(raY9Jw@A%)_S#1yCDhfB-GUcwT4H?r3e
zIrS2$*B;wSy`+b#r-~p2N~@wu?WO$_+C%S^dg`G<K>EGi{HhXFO5V(yo%!C(H}jr<
zdG+)M0K>522qCOO(GWpYVAp+f&P<n0XF8pmx^ERdf#^BgvArRIa56R7fEXH7#5L@I
zCZNt%?aEkwLO_i3KdYiqVD|<_*72-qs~Y}jWo0Ff-AJft*02Zq+DUcKE~kg9Rdc>3
zpxm{~WgeI;WV69hts3^CO&~H|HD~WJg+d|QfY;EjqC>-eyuOCxXPlp}c~*s9Zk>7S
zqkbN?o4#7L9WU=yEweHZ!vTTD_{Gw+RWoeIVDkNO973mx!y1m@s6g{JaY3n$S9S=T
z43L8}J%UdUq$U&OGo_&m-2$x@bH*BRoucVox4nDRYM$wMEU`72Wo=vI6A(BiqkAR(
zb{;B@uTkrhmM@x)V^t*^eHu>Ult9Rq*{zqIb!O{pWyg_5M)vr$z~0sT$;@V#)MN~2
z1==o-dsfwO>Xj)9_pUK#RXw|C)qI);G@O$hMc8=9lc+-)&f`t;<5&+o_S>Hm4nkWD
zBLYVQG_!QyELu)+-l&))>_PIlVc#_z*RW(CQvF7pb9GTe98rn+wuZ}c8Y9KBTeCPA
zBW{VJY1DSCaX+yMbE-_s&b((9XU5D~f3ISUBougfPRd&hteBFMmSkZo<*7-5c;2m7
zi`FGuf@!P6+$;Of!MfnOUd`j+jalA3w^WOP5e>pPW(cF-5HZ{!+Y_#5mW>LpNTpse
zif+y0r=}=w#ZkcfDsIcBejw1faVczP&YiK+97s-1FeR7FqUToU1wP$8TdR)2@s~}f
zRJLlJqpmwspB>m*&nC-%0w?BYt!>;lGZI|&fz5Nd3Nd1q%X!<g21rj<&f7@YtktZV
z3NmzfOHJFQs-h^c|NmWi>4Um(fP)a?RSHq^iJ=ygPXJ|@SA=gA*DQA(l!7wS^%&wI
z6@hoS%FjVCM~OOJ#WQLurC5Ucef)}Cl~G?G>q;~|!LF`wIM)*n<-$W9G%KY=d>qOs
ziKa{>oQdjD+7@xBTaTXn94%dXv{#QTVy9Fx5j~nw7NX*-mEXE`MVZ*}KOgw_EulqM
z`sn)^j;!l4cG1ULH|2WtsIKIEtY-^hBF=?}mas2jEaRY(QFO&m<0MTzy3#AR5?JcJ
zPmu)Z#_ZQ^cZL=eg8WMVj;HAHze}1zK23AvPm(2x(a3OuH*YWbZs*RxPIRLYy=X!o
zc43h3_82|#XvTH!Z=)4c^scZgpI{%p;0yF6_g^#a8}{!Z4&qzBs6U|-f8a3wqW-sh
zGmyd+o_ZYd6}l)YMpcY+<(F4T2q6wUN8|-mG58N6RA2HJMm)!9G~g=U4VsA`IR^?+
z?tF*z%_W?8j5pZJeTg&6=<i;};3KFcihn<2IP?fD^4kS+6CP|2`WQ5M5qn5hdtZl)
z$@zT$xey{@zdylSv|ZZZD#N-!Ms|?JW*lS1X&l7~u6;Pehj$pKFiLri`y0%*K<kG%
w>(|;0<t0w2NQ)PUv6fbr#R9GoFhoKpC>yEWWO48L>ve{L%@DXll1pg&7qslZi2wiq

literal 0
HcmV?d00001

diff --git a/primMST.java b/primMST.java
new file mode 100644
index 0000000..2e98313
--- /dev/null
+++ b/primMST.java
@@ -0,0 +1,58 @@
+import java.util.*;
+public class primMST{
+    static int N;
+    static int[][] graph;
+    static void primMST(){
+        int[] key = new int[N];
+        boolean[] mstSet = new boolean[N];
+        int[] parent = new int[N];
+
+        Arrays.fill(key, Integer.MAX_VALUE);
+        key[0] = 0;
+        parent[0]=-1;
+        for(int count =0;count<N-1;count++){
+            int u =-1;
+            int min = Integer.MAX_VALUE;
+            for(int i =0;i<N;i++){
+                if(!mstSet[i] && key[i]<min){
+                    min = key[i];
+                    u = i;
+                
+            }
+        }
+        mstSet[u] = true;
+        for(int v = 0;v<N;v++){
+            if(!mstSet[v] && graph[u][v]!=0 && graph[u][v]<key[v]){
+                key[v] = graph[u][v];
+                parent[v] = u;
+
+            }
+        }
+        
+    }
+    int totalCost = 0;
+    System.out.println("\nEdges in MST:");
+    for(int i =1;i<N;i++){
+        System.out.println(parent[i]+" - "+i+" : "+graph[i][parent[i]]);
+        totalCost+=graph[i][parent[i]];
+    }
+    System.out.println("Total minimum cost: "+totalCost);
+
+}
+public static void main(String[] args){
+    Scanner sc = new Scanner(System.in);
+    System.out.print("ENter number of vertices:");
+    N = sc.nextInt();
+
+    graph= new int[N][N];
+
+    System.out.println("ENter adjacency matrix(0 if no edges): ");
+    for(int i =0;i<N;i++){
+        for(int j=0;j<N;j++){
+            graph[i][j] = sc.nextInt();
+        }
+    }
+    primMST();
+    sc.close();
+}
+}
diff --git a/quickSort.class b/quickSort.class
new file mode 100644
index 0000000000000000000000000000000000000000..deea15db80c91990e4d58707a217ff8aca70f9fb
GIT binary patch
literal 1843
zcmaJ>-%}e^6#g!3vdeb)-K3NxHMO)rT9Q@;lu%R<BnSizrB)oL+hi?UlHHiybc)ZN
z@j?FppP@6n_+lSg20Q)%KI%W=n@_&<q4B$$w50>%?9Baf?z!Lj&UeqAKVBUE4&Y;a
zt)mU?Dii}Dgavx;nfJ|1*>vt^@^|i8MPDF1Z9BF<BhWrFx}ifuhYH=mDHsAB-_`Bn
zcEPRDucK<#eA~BOM?f9f%;j>UIqBYIKu7m0+lGo>f!-ia-M7n`LeX>_tJZ;joK_Jr
z5XG4{h!l1_->L|-*+h;k2RCgulXI$dzu?y_vy#=(gR?S)L4kph6J16(WQ4eZ1kN!R
zw@%8h!PaWF^Ab!$QXr<!uliOk>C`KCIJw^@t2MV&FZ$k8Qpel4pkm0tMO+f-f63?w
zh(M?+AsM4ZC(x91ZRc)Q>ez!31EWY$7{_|x=cF$c&S|(J5N!r;g=A>EXte^T4P<0g
zHNY=BI<vZF;2pdxpgE@FuG<wWfLhWp&iHyEU-PX}3nW>#J%1|M$Jd`U@IF2eI8!mV
ztvS~zn*L4O-{Q*iO~>~n_uObx%%kl4Adr=Jr=`cz2_7=L83P~6iV79Wu17-3oLl15
zy=*(yY9Q*md8bTEXTdj%+bd?ZwO1;peCX)N=JC*@teyobe!`K8MV82BPCzfX^;*$d
zuqAres|roaXJTQ^x~}i}HM6>6`CD$u)3CyeBB>!Sa893pU=>-Hu9NgB<Wy25rKp}&
zbe)pd9meN6zCc06x>VqXz)<k|fj+i#-`%z{%|~tux?mQ4x3(kj^U*SBIW`F_nog-~
zc|*&tyIrqlk0*V^^2WvWovL+$`%!J0|8Vx`6SW}b%yPM4`&L%K$jSe2u55aq<*E2m
z;Nr2IPNJ&fD+>1iu52I8yl|eapp8`rD6Ahg8;&1wm*6Zohf+@=e&s^2Eg?7tFKDvS
zv|Rt>Rh4I3saSd@rre%T;uE2W5(({LE~3Qu(3^@V>BJs79x7tL@lPreN+%w17i#P`
z{*{iqjlZPJM3|#I&2xx^^ZSiwawp9pV&_va8Y7`!7^^K{vw&W%6@DRfkefjs{p5C@
zyJ5Ds3|WrTI*m@uq6<st#u|Tu0{U=^p0{xt78~0vQP`$luy+a(?(a+xgUzv(-)azn
zlEmV>7)-_D2T*5Hv4m1OKxZnU+@_&ZO4KA3B^h9lV~n72hDdNs20_{(;^a1mPny`G
zkJvihfBFqQw;rSKDF&7wBi8rU6P&;N1jE<k&-7Jk;AX6SLZP0!=pBnF@-W}j^8i;T
zm9h4Cz(;Pv^1^$;1udfS!T=3p5iNa)34q8CHNL~&(Qs6;CN-W#wL?tFlQF_xf1S!I
zH3GZpDO})c2m`ppRED`4!5F*bIOi-bvtX`Z5oxU8DsJE!zG2_1aQ5i&J!AfWN&LwF
zQtF(9(jY`g#k`6hq2g1P*>m*2KwMG8a|+jv9R1q(TAy+5;%bd*EeGQ&HfYnizsVQe
H#M%D<R-l_}

literal 0
HcmV?d00001

diff --git a/quickSort.java b/quickSort.java
new file mode 100644
index 0000000..6e11c8b
--- /dev/null
+++ b/quickSort.java
@@ -0,0 +1,57 @@
+import java.util.*;
+public class quickSort{
+    static int partition(int[] arr, int low, int high){
+        int pivot = arr[low];
+        int i = low+1;
+        int j = high;
+        while(i<=j){
+            while(i<=high && arr[i]<=pivot)
+                i++;
+            while(arr[j]>pivot)
+                j--;
+            if(i<j){
+                int temp=arr[i];
+                arr[i]=arr[j];
+                arr[j]=temp;
+            }
+        }
+        int temp = arr[j];
+        arr[j]=arr[low];
+        arr[low] = temp;
+
+        return j ;
+    }
+
+    static void quickSort(int[] arr, int low, int high){
+        if(low<high){
+            int pi = partition(arr, low,high);
+            quickSort(arr, low, pi-1);
+            quickSort(arr, pi+1, high);
+
+        }
+    }
+    public static void main(String[] args){
+        Scanner sc  = new Scanner(System.in);
+        System.out.print("\nENter number of products: ");
+        int n = sc.nextInt();
+
+        int[] prices = new int[n];
+        System.out.println("ENter product prices: ");
+        for(int i =0;i<n;i++){
+            prices[i] = sc.nextInt();
+        }
+        long startTime = System.nanoTime();
+        quickSort(prices, 0 ,n-1);
+
+        long endTime = System.nanoTime();
+
+        System.out.println("\nSOrted prices list: ");
+        for(int i =0;i<n;i++){
+            System.out.print(prices[i]+ " ");
+
+        }
+        long execTime = endTime - startTime;
+        System.out.println("\nExecution time: "+ execTime+" nanoseconds");
+        sc.close();
+    }
+}
diff --git a/topologicalSort.class b/topologicalSort.class
new file mode 100644
index 0000000000000000000000000000000000000000..96ca9627b86776354bd282b39bdf5c4f6f2c9589
GIT binary patch
literal 2280
zcmaJ?T~iZh6n@@(uputxLxKuIS40dd;76<0AT30wK?K_%R%xqCvWAt-ZkpXtX|<oU
zy>72MUUj_jx-b(R?R0w6n_l;_Grj3me}dy^pLY`>DASo_-;X`-InQ(6=bZiH>BC<E
zjNrQ{0thMysR*M^py`Ibqz_uUog18<zhPuNfx02nHoakiV7za(9ud?lh^p8IRiM#x
z3XbLE%#3cOog%H3CDS!MBP$S?yCSV$QPGGd0WrmYO766%*p60#aIUBq7U*|wE*0f|
zn~ELS$#wR+D-epOD&g8ybYM5lT~E&}3N%mp7)zdM4W{K*B8o1&sz6h*2i-K-;E=LC
zBWDyPEZr&@)7J&s=(pm*XIZtNj~?t((5qrU;w1J$4B{!2T!QV5*Bq{-C{gRLx>b(@
zIH=%|ihc}iN^5%A^^81OIwhtnR`F&!gBOaX?WMh<q30739464{tZtcE&A4e~NY=46
zr<gU0Q5?lF1+S@i9mfT>`#?9JC*6YdX4wo-i<j<AJD2F2m26L{cmt<sYr13kg178n
z@D=%HNX2Q$3okeYf!6pI{A9}CQYoNOfe1qpYRT|Dq*^GfGb+X~F0do7FB(b5&gkAH
z(_7$-muP#u-dH?Y>$Zwak~^y+C7FeN4hqgaztPH#XLQ>(iZZ|FRZL-;LNg`L^+cxZ
zLg{%TqnN-uQrhnd?5t*jxvDkkn~h+GZ=++>N>Q^*`FRe`b<NY=Mfa2@UCgSuB$+C<
zanqw>6tqTgMWAbJYV(<_Q84VRVP{N(M<aNjf~okeeWS%o+LD$xblcTRTK}-N)OSjT
z`B24GT%*)vm=_bjo}qbU6l7HxpqgvywPL_}%`E7}5uTS7l$3?Fpu&{J9g)>4%Txwi
zRAI@@aK>_6LtcAOpgwKpY~3prd6&JFjBeD~P>u4L1X);#;RNF(oh<DeCr#U!^3yk?
z&s*GS@XPbOUZ}1^d0k#rTYRp@)4C>!Zzy9`drdU$l!_T++?0M=U+6LeQuE|K>NuY3
zv5A~FyagxgM(_zGDEfyR>u@WI+xSeu=TeDZ2=r_;1=C(~77g|eSqv3%j_VoEDY689
ztSy(SVa5Ad-OgHu+cW7ni={&1Wd=1nn-0z_7mO{;YjdzgAE~-X>XwyeKV_QLloWo_
z(p}eZ6?`qQ?<G!KK~?Y#mHPjtR855!J7|Po1R%tbeVen0?AHFsmhX>j#}KeN55Qq@
zQADWYv%sBBj)G(Oz<r3HIT84XPx%@M(ivMk=hE~h*D}<}RVeMDncz^zDjM!W<Fez}
z9ki^Xx&3IzK<Fo~A0W0O#Jy*KuVPpG19X<L_mcD;@V$3I;XKMH+Xz}kHyY5(`5_WG
zfo2r_x4|cfh|b3Z8<F);Me#jRNNneViFQAJOu}J&g>hmlV9<Y8(bqCq#t{ZD<HQ~8
z;YQPlze@aut}@=d_QOLYfim8{_w26?VBHJ_X0IMG!f4~Ol^?Tq?B(+ivpB&vD#5Wu
zJwZUU5S-FWYZqP>-amv_M~mB!FmZVmllO69Qo>0y)WI??uAzab`THI31=i5a*)O3r
zDAML~)#kKZ%n^TZxO4Yi^z+;Y!7}vYq4imq$&Q7ZMzTj^VLn6CD?t+f^8s=+xv@cL
z)R%<D-0q<)x_v79**gZA?-TrV4xtZc*qhJcATE;PRSZxf2T;Oc-uDsQ!ZDw40|HMm
zu3$ol$25u1;Q58@^+f?}dxW0L_mN-2E*Za8M+%d&#JvDMrdKIZflv8g#+O`0Ir|DL
I_!hhV12K6Tng9R*

literal 0
HcmV?d00001

diff --git a/topologicalSort.java b/topologicalSort.java
new file mode 100644
index 0000000..a4b5ac6
--- /dev/null
+++ b/topologicalSort.java
@@ -0,0 +1,53 @@
+import java.util.*;
+
+public class topologicalSort{
+    static int N;
+    static int[][] graph;
+    static boolean[] visited;
+    static Stack<Integer> stack = new Stack<>();
+
+    static void dfs(int v){
+        visited[v] = true;
+        for(int i =0;i<N;i++){
+            if(!visited[i] && graph[v][i]==1){
+                dfs(i);
+            }
+        }
+        stack.push(v);
+    }
+
+    static void topoSort(){
+        for(int i=0;i<N;i++){
+            if(!visited[i]){
+                dfs(i);
+        }
+    }
+
+    System.out.println("\nValid execution order");
+    while(!stack.isEmpty()){
+        System.out.print((char)('A'+ stack.pop())+"->");
+    }
+    }
+    public static void main(String[] args){
+        Scanner sc = new Scanner(System.in);
+        System.out.print("\nEnter number of tasks: ");
+        N = sc.nextInt();
+        graph = new int[N][N];
+        visited = new boolean[N];
+
+        System.out.print("ENter number of dependencies: ");
+        int edges = sc.nextInt();
+
+        System.out.println("Enter dependencies (u v means u -> v):");
+        for(int i = 0;i<edges;i++){
+            char u = sc.next().charAt(0);
+            char v = sc.next().charAt(0);
+
+            graph[u-'A'][v-'A'] = 1;
+        }
+        topoSort();
+        sc.close();
+    
+    }
+    
+}