From b0bc3b64c2595129683b83eeed1fc296d7fe6cca Mon Sep 17 00:00:00 2001
From: DHRUV SHARMA <115227371+dhruvsharma2001@users.noreply.github.com>
Date: Fri, 14 Oct 2022 04:07:28 +0530
Subject: [PATCH] Add files via upload

array in java
---
 Arrays/binarysearch.class | Bin 0 -> 1095 bytes
 Arrays/binarysearch.java  |  25 +++++++++++++
 Arrays/bubblesort.java    |  27 ++++++++++++++
 Arrays/countingsort.java  |  36 ++++++++++++++++++
 Arrays/eams.class         | Bin 0 -> 1071 bytes
 Arrays/eams.java          |  16 ++++++++
 Arrays/fifa.java          |   5 +++
 Arrays/hiiii.java         |   3 ++
 Arrays/insertionsort.java |  26 +++++++++++++
 Arrays/jajmo.java         |   3 ++
 Arrays/kadanes.java       |  21 +++++++++++
 Arrays/lap.java           |   0
 Arrays/largest.class      | Bin 0 -> 1064 bytes
 Arrays/largest.java       |  20 ++++++++++
 Arrays/linearsearch.class | Bin 0 -> 1122 bytes
 Arrays/linearsearch.java  |  21 +++++++++++
 Arrays/maxsubsum.class    | Bin 0 -> 1194 bytes
 Arrays/maxsubsum.java     |  29 +++++++++++++++
 Arrays/pairs.class        | Bin 0 -> 1065 bytes
 Arrays/pairs.java         |  15 ++++++++
 Arrays/prefix.class       | Bin 0 -> 1228 bytes
 Arrays/prefix.java        |  32 ++++++++++++++++
 Arrays/reverse.class      | Bin 0 -> 1115 bytes
 Arrays/reverse.java       |  20 ++++++++++
 Arrays/selectionsort.java |  27 ++++++++++++++
 Arrays/sort.java          |  75 ++++++++++++++++++++++++++++++++++++++
 Arrays/spiral.java        |  48 ++++++++++++++++++++++++
 Arrays/spiralmatrix.java  |  48 ++++++++++++++++++++++++
 Arrays/stocks.class       | Bin 0 -> 692 bytes
 Arrays/stocks.java        |  23 ++++++++++++
 Arrays/sub.class          | Bin 0 -> 1101 bytes
 Arrays/sub.java           |  20 ++++++++++
 Arrays/trap.java          |  32 ++++++++++++++++
 33 files changed, 572 insertions(+)
 create mode 100644 Arrays/binarysearch.class
 create mode 100644 Arrays/binarysearch.java
 create mode 100644 Arrays/bubblesort.java
 create mode 100644 Arrays/countingsort.java
 create mode 100644 Arrays/eams.class
 create mode 100644 Arrays/eams.java
 create mode 100644 Arrays/fifa.java
 create mode 100644 Arrays/hiiii.java
 create mode 100644 Arrays/insertionsort.java
 create mode 100644 Arrays/jajmo.java
 create mode 100644 Arrays/kadanes.java
 create mode 100644 Arrays/lap.java
 create mode 100644 Arrays/largest.class
 create mode 100644 Arrays/largest.java
 create mode 100644 Arrays/linearsearch.class
 create mode 100644 Arrays/linearsearch.java
 create mode 100644 Arrays/maxsubsum.class
 create mode 100644 Arrays/maxsubsum.java
 create mode 100644 Arrays/pairs.class
 create mode 100644 Arrays/pairs.java
 create mode 100644 Arrays/prefix.class
 create mode 100644 Arrays/prefix.java
 create mode 100644 Arrays/reverse.class
 create mode 100644 Arrays/reverse.java
 create mode 100644 Arrays/selectionsort.java
 create mode 100644 Arrays/sort.java
 create mode 100644 Arrays/spiral.java
 create mode 100644 Arrays/spiralmatrix.java
 create mode 100644 Arrays/stocks.class
 create mode 100644 Arrays/stocks.java
 create mode 100644 Arrays/sub.class
 create mode 100644 Arrays/sub.java
 create mode 100644 Arrays/trap.java

diff --git a/Arrays/binarysearch.class b/Arrays/binarysearch.class
new file mode 100644
index 0000000000000000000000000000000000000000..c9bd048e61a5931e83d9ca6fbc8f49750d867d6d
GIT binary patch
literal 1095
zcmaJ=T~8B16g|`3cFVHZ0v1GCtqRx{XjKwotn|Sq#3sdRN-zyCOxp=8-R?HKQ<DA#
ze}RuiA9&$KAJh=T5AfMvWBj_?l2Ah9!_K{T_TF>unYr`*&*>R}0@ic{plDDH1QBA0
z9`Ylev$(yVtJDugLo$S(nzktm3`#1!Glnq6H0TD#VO&bD_B<)tl;w1(C|2$RnNIGd
zYud6ZUBTOV9oG=i5H&D~DF&l%+T87Vg1e0as-%$UQoE&6x->=YT{jTJ48v@jw?xsg
z8(h9N<pFt~<hJyPCRIugnEEXfjcM-_%?-?HxM^S>afay;tuSaEzcGs#W2vhU=^X~O
z=rjdGq-@&aMYmlS?l!Mmv@=naywTd?o%2|2bHDSM)b3~?z3Oz`hS)Uy;>lsrS-&+p
z#%GQrJ?Zk!mXHTd(~E?#q~ktP8q)qDWEd7MZpO5aoR-K9)DF&NlQ*Q}_88s{i#bmm
zfIjDT(-Pi7*>PIkPX21ELpzrWw|gBiB7IowU{><OcX19;<d#)6rO1b|LgMXi()5xR
zclU)SlTVV2rl4fo!Yx|d^Mt1%$FO)s>L>*o9x~kee=3dBKrZgk=mlt|00qpSby^b?
zCCD<e!OR!1kK_<0t^RLN!I(d(<ol^_C=QZ+tZZb?)Mg=`_<+@TVlQZ|tC^UZoqvZ=
zOg-tl?=c=z)xC{lgvmAw$A5nWPWp&GdImbJDm3CTXq~24HBVf(=v6JzP8JcY5%W56
z-=@qcg1@0L_KRLa<R?_WuOvwt^!1966v|o+f75G<TB)hQN-Y=-Rcaynv~Z;y4Q+ga
zwjBS8iBlrOXUtwmouYEkjLl&Nam-?cUXOyiv=_iVERYQo(IS1zSfxlOFN+6wgt>nP
C@c@MY

literal 0
HcmV?d00001

diff --git a/Arrays/binarysearch.java b/Arrays/binarysearch.java
new file mode 100644
index 0000000..e321992
--- /dev/null
+++ b/Arrays/binarysearch.java
@@ -0,0 +1,25 @@
+import java.util.*;
+public class binarysearch {
+    public static int bin(int numbers[],int key){
+        int start=0,end = numbers.length-1;
+        
+        while(start<=end){
+            int mid=(start+end)/2;
+            if(numbers[mid]==key){
+                return mid;
+            }
+            if(numbers[mid]<key){
+                start=mid+1;
+            }
+            else{
+                end=mid-1;
+            }
+        }
+        return -1;
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,2,6,3,5};
+        int key=6;
+        System.out.println("nu is largest : " + bin(numbers,key));
+    }
+}
diff --git a/Arrays/bubblesort.java b/Arrays/bubblesort.java
new file mode 100644
index 0000000..3b9547d
--- /dev/null
+++ b/Arrays/bubblesort.java
@@ -0,0 +1,27 @@
+public class bubblesort {
+    public static void bub(int arr[])
+    {
+        for(int turn=0;turn<arr.length;turn++){
+            for(int j=0;j<arr.length-1-turn;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+        }
+    }
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+
+    bub(arr);
+    printarr(arr);
+    }
+}
diff --git a/Arrays/countingsort.java b/Arrays/countingsort.java
new file mode 100644
index 0000000..354b469
--- /dev/null
+++ b/Arrays/countingsort.java
@@ -0,0 +1,36 @@
+public class countingsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+
+    public static void count(int arr[]){
+        int largest=Integer.MIN_VALUE;
+    for(int i=0;i<arr.length;i++){
+        largest=Math.max(largest,arr[i]);
+    }
+             int count[]=new int[largest+1];
+             for(int i=0;i<arr.length;i++){
+                count[arr[i]]++;
+             }
+             //sorting
+             int j=0;
+             for(int i=0;i<count.length;i++){
+                while(count[i]>0){
+                    arr[j]=i;
+                    j++;
+                    count[i]--;
+                }
+    
+             }
+    }
+    
+        public static void main(String args[]){
+        int arr[] = {1,4,1,3,2,4,3,7};
+
+        count(arr);
+        printarr(arr);
+        }
+}
diff --git a/Arrays/eams.class b/Arrays/eams.class
new file mode 100644
index 0000000000000000000000000000000000000000..fec3f192c01ff77eeb04153ac5625b612f15d941
GIT binary patch
literal 1071
zcmaJ=%Wl&^6g^`nabjGOwzO$UUqB0a&;%&&6c$9P2ucZ3s-mhJCdsIE<JgfssZ@z&
zKY}$I*03n3Lj3^#gcW<l>)MIbRE=2JcV>L<Ip^NF{`Tki1i(`~)S*Dt5Hb)(gdwrV
z_j$qM_D-Q%-xCeV5Lq>CQ$A%-)0s^jQN%Rp1}?y02npWy2-58|xfBfH^maM38N)@y
zH6#p-V(biO?ZA_wO;k>om?tWMn&}i?xuz{^(j~g$7#X`{U;>j2$u@6^l4Ccxd~M2I
zT6vP&k|Zb6<xDR<FiW|ny;IaNg=r0!4Wux`Fg}EzOm=)VpW-}$U*Qzy49xr8&;q1o
zQ=uiNN%h4mrY&A}+jZe?@VZ4OBQ?nzt##h%??Y{F5`HqhJ&at#bp~a-%%IntuG<i6
zrcV;{+nD#wQn#Ktj`XC<JL^L3I!!MgK~Bd_ENjU7Z7DD;p5Bsa?>j9~=+)or)EaL{
z$30+pH&|dF*du+;?WQHX#fsy!x}D;As{<!z5;qPyVhDV&*xuX}2XCiOQR0?WGo>g-
zahuw}78s1OZ40+#anBQ;hPw<)=V}{fS;KvXx&K3HE_?Oi3Qes-V+E+7`$vS{3$&Z1
z$S8)hpTR!Tf)NzKXHY`SAM!r*1wsKuQe91DPu^oRo64s0p*Ph-#y<T0;U_CW@)!X@
zPn2{L6epqKDxJij{GytFVw{%Ou-NB)OAwVlKaPCWx70+Vx)n;)t6Sj&uU2wjps7!0
zawM1hgpu4#{+P0Hgyf+@qTlK42(zcsb0p;pjYCJ0yw8*SWr{2GKR!Y{uwg*??f)W6
g<YbzZZ%~GUG%^&U<S9$fE!?4<POBB%!vjqJ1No==umAu6

literal 0
HcmV?d00001

diff --git a/Arrays/eams.java b/Arrays/eams.java
new file mode 100644
index 0000000..19d7fcd
--- /dev/null
+++ b/Arrays/eams.java
@@ -0,0 +1,16 @@
+import java.util.*;
+public class eams {
+    public static void update(int marks[]){
+        for( int i=0;i<marks.length;i++){
+            marks[i]= marks[i] + 1;
+        }
+    }
+    public static void main(String args[]){
+        int marks[]={99,98,97};
+        update(marks);
+        for( int i=0;i<marks.length;i++){
+           System.out.print(marks[i] + " ");
+        }
+        System.out.println();
+    }
+}
diff --git a/Arrays/fifa.java b/Arrays/fifa.java
new file mode 100644
index 0000000..f59d136
--- /dev/null
+++ b/Arrays/fifa.java
@@ -0,0 +1,5 @@
+public class fifa {
+    public static void main(String args[]){
+    System.out.print("hello");
+    }
+}
diff --git a/Arrays/hiiii.java b/Arrays/hiiii.java
new file mode 100644
index 0000000..536bc9c
--- /dev/null
+++ b/Arrays/hiiii.java
@@ -0,0 +1,3 @@
+public class hiiii {
+    
+}
diff --git a/Arrays/insertionsort.java b/Arrays/insertionsort.java
new file mode 100644
index 0000000..1b04fee
--- /dev/null
+++ b/Arrays/insertionsort.java
@@ -0,0 +1,26 @@
+public class insertionsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    
+public static void insertion(int arr[]){
+    for(int i=1;i<arr.length;i++){
+        int curr=arr[i];
+        int prev=i-1;
+        while(prev>=0 && arr[prev]>curr){
+            arr[prev+1]=arr[prev];
+            prev--;
+        }
+        //insertion
+        arr[prev+1]=curr;
+     }
+}
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    insertion(arr);
+    printarr(arr);
+    }
+}
diff --git a/Arrays/jajmo.java b/Arrays/jajmo.java
new file mode 100644
index 0000000..df98078
--- /dev/null
+++ b/Arrays/jajmo.java
@@ -0,0 +1,3 @@
+public class jajmo {
+    
+}
diff --git a/Arrays/kadanes.java b/Arrays/kadanes.java
new file mode 100644
index 0000000..e133c1e
--- /dev/null
+++ b/Arrays/kadanes.java
@@ -0,0 +1,21 @@
+public class kadanes {
+    public static void kad(int numbers[])
+    {
+        int cs=0;
+        int ms=Integer.MIN_VALUE;
+        for(int i=0; i<numbers.length;i++){
+            cs += numbers[i];
+            if(cs<0){
+                cs=0;
+            }
+            ms=Math.max(cs,ms);
+           
+        }
+
+        System.out.print("maxsubarray sum is :" + ms);
+    }
+    public static void main(String args[]){
+        int numbers[] = {-2,-3,4,-1,-2,1,5,-3};
+        kad(numbers);
+    }
+}
diff --git a/Arrays/lap.java b/Arrays/lap.java
new file mode 100644
index 0000000..e69de29
diff --git a/Arrays/largest.class b/Arrays/largest.class
new file mode 100644
index 0000000000000000000000000000000000000000..e7070a8ed610a2f4e8d582bba1929fb68cf36f43
GIT binary patch
literal 1064
zcmaJ=T~8B16g|`JcH3pKrF;n#tP0u|rG7tH<iRGyCdHbRU>cr=GAT>9v(4_5gf}1j
z5kB+ci!b`1h8TW;zr|l*;>X=~BPBFG%*?$r_nvdl%$@JQPtO2s;E9O{Gy_o!I${i|
zLw>}I4wtQBZSPPt6+>*@mbThp&~o`51966l^Pq}Uq9r`-4WT742Ft*>g)2y2fT|z+
zN^}Up?GfN~wV!Xh#aEs!Rb6?4cS<HEkTx)BVG7d>hQqy<@G0DE3H8s>bGwy%B~5Iz
z7OrBBVYb8DqU_2hSFde#K$fq#R6g<KD)|9bUk~xvvPC=#$QW3(u!L(2lOt*&_HIy_
zBLk4j5cwU3XxZHt49Ti3#mio2Pk7sW&!L_1y5i0D7Vn0Bw8L$}naS;r1~Thz&ufZJ
zJ4m)dp=&`^bcN4dSNY20-7TRG+<iY8L*7IIs|M}_`tLF<pFf5zkKDE>4ulS_WRo|Q
z>m4(^8`cp94nSXUx$g*nx$3&@Ubl3)%AuVLiQC6rF(Q0e=b(p5!_N>xl)2;7Z6!)^
z6se<RFKheRP<{4kmeE~Qq!eD+;l3|?0}mKhE=e7wz`!GhrT>RgR}bXkI<;Md+6mCW
zf<HiWmb^t;8LfKZ3)n|87=@yL3`$4@T^fe&QmRI0OX<YA_AFC4JHgaKA+vS@gXZ<O
z5%&JikA)8u5$R*h6ABQe9G!kl3~9tMLw1I|8+0-T?H6>$Qa@=kfty$ki7J#7)S8cf
zGaFj8)`;r0hMtPm8ZjD1yjJ}LbM-4yr-X;km_M)kO25J+=8!@TljN=R>$!#7w8n`b
RM`I25$TP{hkB4}Sxxd}K{_p?*

literal 0
HcmV?d00001

diff --git a/Arrays/largest.java b/Arrays/largest.java
new file mode 100644
index 0000000..9a1ffdd
--- /dev/null
+++ b/Arrays/largest.java
@@ -0,0 +1,20 @@
+import java.util.*;
+public class largest {
+    public static int getlargest(int numbers[]){
+        int largest = Integer.MIN_VALUE;
+        for(int i =0;i<numbers.length;i++){
+            if(largest<numbers[i]){
+
+                largest=numbers[i];
+            }
+        }
+        return largest;
+
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,2,6,3,5};
+        System.out.println("nu is largest : " + getlargest(numbers));
+
+
+    }
+}
diff --git a/Arrays/linearsearch.class b/Arrays/linearsearch.class
new file mode 100644
index 0000000000000000000000000000000000000000..fb9e24180af2caefff1ec6e9938752a8b2300d6b
GIT binary patch
literal 1122
zcmaJ=OK%cU6#nk;7#Ju_>C0NER9gjVOMNe}T}aYMLLHT+hIDlcH|-RdAv2do_WlGH
zE*m%9bfXJ3jp+~Y$M^$`sh$B6X=q&Bdmi_k@0{=6bAMc%odejw6AcP{D*RCd5M<B~
z`4P`IxwW4+_6|i&G6bKRmMJ$Fe3|Tyh7iIkv?wBoGDMrECAj0#svR%{dM2f0c1xvf
zDU2B6D)cDEk+_6i>AF(12-5CQg{g9{s%ht6I;JHn(h<B>2w{=}EL&=r#*B(<QOx2x
z!^9QARJ!e@5>}=U)}ug3rnO(l?j(q8GKv)D8D?6%A&RzD<MNFu4@h$*x1{Ukma?PS
z4E~~B7Yy+-k$ur=?Fna_?={IYR*}5c*y8Ph?Qe0@VwleCj>2SjR4g$lyCnv#Vt1UH
z*fc$m@!>mM^~ljxJ+p1;N{6?%ggmh8Zaj#bhGpDUvEuPqWmx?8RHk)gH$=Wqw@+=8
z*QD)q89oeO$RMx}`kY(!rf?U_w%zEo3!^O$c`hYxciZBM@L|&Z;VBGX=K!L}o6U+T
z1-<VYk#C4@+H})grcJ9Z-liE1Rmrl1Q*3hA6|Ra03`-+auVSF$5ySldLuoeqbg@8_
ztk75hKG66eNc#=4QY0D4K<+EpCsG*Fw0p;%9`**Gq!;?i`#U6Oee22G`9~yj$<?`I
z1d^xk6n66Gr*cY%N-uqyDtMJb@FPz8IO#KFEs$4(?>7_{`$hgRZsOJe{yoL|>Aa$c
zzH3!qz^M9FqZ-hIMm4C1jH;?@Mm3~IjjA5hW3;QfZj^OxeL49J>PAXAM(i`j5))rA
zb%HplsWZ$0WO}^%jm<+PJ%SZtwT3Y~raxPt7B`W=YfSbUj6k`-riw+zBGmWoUh*Ae
VNQS7_EUi55k)@G#9}fv+_AlZG1rz`P

literal 0
HcmV?d00001

diff --git a/Arrays/linearsearch.java b/Arrays/linearsearch.java
new file mode 100644
index 0000000..db1ddee
--- /dev/null
+++ b/Arrays/linearsearch.java
@@ -0,0 +1,21 @@
+public class linearsearch {
+    public static int linea(int numbers[],int key){
+        for(int i =0;i<numbers.length;i++){
+            if(numbers[i]==key){
+                return i;
+            }
+        }
+        return -1;
+    }
+    public static void main(String args[]){
+        int numbers[]={2,4,6,8,10,12,14,16};
+        int key=10;
+        int index=linea(numbers,key);
+        if(index==-1){
+            System.out.print("not");
+        }
+        else{
+            System.out.print("key is at index " + index);
+        }
+    }
+}
diff --git a/Arrays/maxsubsum.class b/Arrays/maxsubsum.class
new file mode 100644
index 0000000000000000000000000000000000000000..e33dcb46e0dcdedeee3fe5ace9a33ce044f2a27d
GIT binary patch
literal 1194
zcmaJ=T~8B16g|`J?$TwU1uO`qd?;!QN)@G|d?nU2kQ8ey!89c5v`k>3-EDTaMBaSh
zNBE2nKI;P#V)z041%HIkl8D~j5`oZ|&Cbl7IrpA>?%X*(Jv;(1ho>3>kW>V9$WRy}
zn|zz6D%@O8<x88Q>@p}bhH1ES3{oPwqN0VN;~cbTx?)|}(g%tbLMwC?Z93W!z7(pk
z<G7+q5v)1|jOKiQ!%Drh4bv^Sw&2xi4ISuI(WT=Wq6}S4FbrzV^Qf2%!Ng*6rIT2D
zbX-R-Lr;}&iHv2Ix%=91H)!R!+;kn{BWQ!t*F}7Wx$g7Dbo3+6Ap2oG<W*d9MZ+M5
zR1E95ftw7WDu3_POHSPr<d1S<m6D;HGS-@42<Hq_yr@@8!d~X33hlHNTwdN<;<Yn7
zSmg$3=uWIQ<73bYR^2X(tl>Gg|Kl6?YC?s5W?8P|+Pt<T+zo5Z2`jj#VH_zH_q}R7
zU>G^SBE#IawnVBSyHTJlFT0k#!|?H<;4@$&=mIy_D#97bS=Ls)HhneE3p<w_mv?HS
z3H+kcMrTc5yp*#L8D6Or3|CCI;33_%ue{0_^hMJYcBaA|M>s0d47aWbY?il*DTaan
zL#e|XA~8%C9iWy1Bv4a8p>c$)IL(Y^dGs6D7g`WKjoz`h4tae+vj_b_t}Qgbm1a6a
zv(j9A^k@$Y@pLermZP#~Oh)CjBF#jDX*H@wl~0JoMx*NZyO~{;eg5<FE40`?BK@&F
z$g$a7nf8u%B^nRtr2i1zz&`rCBm#aCS$Z}=kSv)#dVNG6p_KZdVSpaw5Oj>u?gY(K
z2xFd3pOa6PFge1%LJ!_h&)lXc15i()GRA(R)f*y=ouKOkZNDI&Q1lS)AaN#i-sc1c
zTfS>WDVQ$?Bd7VI98vN`C6F(wN<KGsfPwRBwNqt4Y4ssSMEztXeG#LS9w=#syYx@s
O5m_3oCh-_g(EAtuvKGhy

literal 0
HcmV?d00001

diff --git a/Arrays/maxsubsum.java b/Arrays/maxsubsum.java
new file mode 100644
index 0000000..46d3ce1
--- /dev/null
+++ b/Arrays/maxsubsum.java
@@ -0,0 +1,29 @@
+public class maxsubsum {
+    public static void sum(int numbers[])
+    {
+        int currsum=0;
+        int maxsum=Integer.MIN_VALUE;
+
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i;j<numbers.length;j++){
+                int end=j;
+                currsum=0;
+                for(int k=start;k<=end;k++){
+                    currsum += numbers[k];
+                    }
+                    System.out.println(currsum);
+                    if(maxsum<currsum){
+                        maxsum=currsum;
+                    }
+                
+            }
+            
+        }
+        System.out.print("maxsum" + maxsum);
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,-2,6,-1,3};
+        sum(numbers);
+    }
+}
diff --git a/Arrays/pairs.class b/Arrays/pairs.class
new file mode 100644
index 0000000000000000000000000000000000000000..422c9006574a5a886e61c8ac8c4199dc11eb93fd
GIT binary patch
literal 1065
zcmaJ=TTc^F5dKcP?Y8Rz1>{-^h@fr3R`8k>(a?n0q*#*@Ov8(Zaso@YyUp$?3D5E)
zeD=j>eLzDDKfninhkrriZBE;S5*oAFoy*RAGvAy!U;mt)19*yu1_B7`&`g97W{4f~
zBc8Rnv!5;P9*U}D2(Ma>CD#~&$<%ff5kz$uCa%G}6ka~|rKnSs+oYtCVhhM}voAf%
zk!9%#Ue66t&3+RDh%t=Sc}?V9r^@9kOCFHsOYTUYVKiANq}utdMkv{G_Hzb?Fs$Rc
zi4lx44EHF&5NfD$R6ltYAhoR^#!XBprg|&Vb_~QZr6XZt8Z!!jTOKt*K%|jO?i5nn
z3|ijZ6AS}I%MmY{^<Cj@@m-rdePzk3wN2jW*jk-ijv}$ss{;n3>^8ls*sxTx(W;hF
zRA`v%t}A`%@y4c*2kxFf5Jt*C8jCuX)YR@U%wL?3<s7*+k!??>J;)7Sm9BTp@V1+N
zC$J6roI88A@aK!JTWdCQS9|R8TuR(JZipV?-7MQ1lj}aa4n&^YcG;357eQ9dlr6Co
zgIRDK;pJ`a`@+|;!mx0KUazio+-I2ne<<y3n<8$|0S9RDfFP(g!t|XbD?yTx45dGT
zeISKVC|bXj9##85a+Z8=pwR<74z9-2=kKtRj%S|4wbyG2WsQG?K9x>n&d>*(V(=u$
z-v9kh&Qpw?Fw(y%^gs)Jj_!|YBtm%V%8gRJ1(J*8StkD@7?`7oL1@1aV87AF*iTIU
zpz9XJP0V*1dPeDr(`@96Q3-}h6-_TyLa}hE5{^Ym6+LE@ii@8yc|oh6z(FPB)Z`45
cwLo?Nw{V+egm9DeW^k7*gS2Jb!vjqG19+MG>Hq)$

literal 0
HcmV?d00001

diff --git a/Arrays/pairs.java b/Arrays/pairs.java
new file mode 100644
index 0000000..4b61721
--- /dev/null
+++ b/Arrays/pairs.java
@@ -0,0 +1,15 @@
+public class pairs {
+    public static void prpai(int numbers[]){
+        for(int i =0;i<numbers.length;i++){
+            int curr=numbers[i];
+            for(int j=i+1;j<numbers.length;j++){
+                System.out.print("(" + curr + "," + numbers[j] + ")");
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String args[]){
+        int numbers[] = {2,4,6,8,10};
+        prpai(numbers);
+    }
+}
diff --git a/Arrays/prefix.class b/Arrays/prefix.class
new file mode 100644
index 0000000000000000000000000000000000000000..10648c4dca2b8bd880234be0994ace218568c1d5
GIT binary patch
literal 1228
zcmaJ>TTc^F5dKd0)-I)77vzo#+7{Y+MNL7YB!rSeO-e8gFCN+>ENyq|?pEQ=M1F+v
zkr$rzL5(r|0AKwP{sswxvn>e_h!5w?%$b?*%zSfpe;$3`2k-<Bbp#-3ki$@*GPG~<
zH#}A0)_N+pwke7pgF0<mruUdZipEwn1Q|L`gEE#U)`cUzBeW1&5Z2HdMg(o=pz_<U
zC#r;C*9p+bHu6n7_1rNnFYh^mSJRz@&=E!_x)^$^yewvItH`|<rnf<w>v79-DL0yl
zHPah4Qm$#Or*#<U(a;;l74$K5U4qY`)co6gh>HNR6&(W@)G!prFh;29nj>DBTclL^
zmRnz=^yq3Pw!$FK+9kozmNhN0RIjcHXPK{6=%h98@nU(A*BZ8lF^0fuh7zjWv>1A#
ztC!u&py%znQxtQi57N@SH|cjk6h5<U&-EN$TNK`gU2@x0Oz4<ILPOH$D#b8%It<f#
zW0ys$NlKHxIbQT^XPe=}*{)9lo1pXDDpiC#mbLA2y_UXM<e8ImiObtHaY^{uHk)rK
zeRgCg5VO2e$(x=?2XUK0Yp`5p4B?Dr31_y#U01jo?lFvCXz;SSHB2!K|38$b*=!P5
zY1#pLaDW6FEmYb^$r>WbNGkEKV4p}~6pDu1*F*l}AUR4#7o`Qsw<Aq=hGydXKlG)9
z6qk}Yc}h0q#QrX>BuE;vTuR0bIr%cTBeT8Z-;(c+ll!S5PbsuiL-ox`L!HtL<s<Zj
zp(Xba@kPQ=D7`d2IIs(4U}i@pgkKGu{m;+`zoQ-af^NUkK%>$HdK7?6meOcThek0$
z^i%CIk|~7o2(6f*Z*(4Q$db2&E|};>na*C5|1CwoCxWgKQUal4aw{6HGv;r=0R|2c
zV1E%|><~R{fgM2m1Lc4&3}GBMngr3$#V-RG3I5OvlAJ5Z?MJzS(yrzTY9Lq8)LeGr
q8~RUKj?ggt5%d$wKF<<vk{v*lDhJih5T|tucgWI7yNmmHfWCjgu^NW}

literal 0
HcmV?d00001

diff --git a/Arrays/prefix.java b/Arrays/prefix.java
new file mode 100644
index 0000000..5fbae3e
--- /dev/null
+++ b/Arrays/prefix.java
@@ -0,0 +1,32 @@
+public class prefix {
+    public static void maxsub(int numbers[])
+    {
+        int currsum=0;
+        int maxsum=Integer.MIN_VALUE;
+        int prefix[]=new int[numbers.length];
+        prefix[0]=numbers[0];
+        for(int i=1; i<prefix.length;i++){
+            prefix[i]=prefix[i-1]+numbers[i];
+        }
+
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i;j<numbers.length;j++){
+                int end=j;
+                currsum = start ==0?prefix[end]:prefix[end]-prefix[start-1];
+
+                
+                    if(maxsum<currsum){
+                        maxsum=currsum;
+                    }
+                
+            }
+            
+        }
+        System.out.print("maxsum" +  maxsum);
+    }
+    public static void main(String args[]){
+        int numbers[] = {1,-2,6,-1,3};
+        maxsub(numbers);
+    }
+}
diff --git a/Arrays/reverse.class b/Arrays/reverse.class
new file mode 100644
index 0000000000000000000000000000000000000000..b35897780fe5c725032e5c992572284ed50fdce2
GIT binary patch
literal 1115
zcmaJ=TTdEM5dO|`Ik;U5)p`XiR#Yx6^xh_@NhL8Q!EO_b4e{v+C%OW=WOp&~ogdL>
zUwm#KY-1XKK>tY7ztE($vp^z7(rk9;a%R5yX3p%7zZaJPHt<G;0w0H8LjXaB$dNb}
z`KB-r^7{Uftho%qHN!OA4F+E-y{jUGF%DJ39cT>PmdDa|B!l167y_xiQhIj`cM;}@
zXt;-o8=#dF$CWL@vN{AkRqmBDto#StFx`r4OVKJ!5VQLlrZCMg(-I9?w9J}tKN{{K
zX^tyQ*P+~0Dcw)+v87zYJSeD`#T>`HhA3hTlOynnWZSFeLEHxLTAam#h6mm_crUVP
zQh!COPW^?;hAH27TKm%85&KQ@j8|MyYix`5!1lL<LGjb6y;0yCD-6nBi9xMc9lIvC
z3=c#b%rWQjrGaf)mg~5-Xm3mR(5gG(AhIeR;W0<fn@pY|d3{rcd2BUgzCVKgu(m|a
zwd@myPs2S90{fuvgjsJ&Ct0?vMyFl4&34FhBXQ@XEk}e8_uJo{!tezRAc~^dtQf8=
zgz%Im!4lMb$uy;1YzoJb4#x|I<y*atqRjD%Vd4Lww7&iRut=M$&}IQX&<Y?(-vn84
zl8j^^^A+qfDU3qVJNEQ3Z_!C6$ae%kJwVd8mbvuT*Q2ph%x7Y`jZ7>P&FPtFT<<d0
zRj$sietJks4{3!kyrT4z5mEpV!k#8;o(RS1ECCfuROKN>5yd~?j77=6gyf)Zmoj~H
zx*7VeR(%1z>gRej5DDtlU?ikhc|_IA*>B*!^;q`u6f<8io{i-$FbSMvrmL{Ct6$_h
zNBo-A0x<x_={LDcs~*NG@p?(JfC;>%OplG`v03C;X1_5<3|7gfAcZu^5OK@U`vlL(
MQb~JG`L8ke4>ni;u>b%7

literal 0
HcmV?d00001

diff --git a/Arrays/reverse.java b/Arrays/reverse.java
new file mode 100644
index 0000000..af3a8fd
--- /dev/null
+++ b/Arrays/reverse.java
@@ -0,0 +1,20 @@
+public class reverse {
+    public static void reve(int numbers[]){
+        int first=0,last = numbers.length-1;
+        while(first<last){
+            int temp=numbers[last];
+            numbers[last]=numbers[first];
+            numbers[first]=temp;
+            first++;
+            last--;
+         }
+    }
+    public static void main(String args[]){
+        int numbers[]={2,4,6,8,10};
+        reve(numbers);
+        for(int i=0;i<numbers.length;i++){
+            System.out.print(numbers[i]+" ");
+        }
+        System.out.println();
+    }
+}
diff --git a/Arrays/selectionsort.java b/Arrays/selectionsort.java
new file mode 100644
index 0000000..b9ad552
--- /dev/null
+++ b/Arrays/selectionsort.java
@@ -0,0 +1,27 @@
+public class selectionsort {
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    public static void select(int arr[]){
+        for(int i=0;i<arr.length-1;i++){
+            int minpos=i;
+            for(int j=i+1;j<arr.length;j++){
+                if(arr[minpos]>arr[j]){
+                    minpos=j;
+                }
+            }
+            int temp=arr[minpos];
+                    arr[minpos]=arr[i];
+                    arr[i]=temp;
+        }
+}
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    select(arr);
+    
+    printarr(arr);
+    }
+}
diff --git a/Arrays/sort.java b/Arrays/sort.java
new file mode 100644
index 0000000..868765e
--- /dev/null
+++ b/Arrays/sort.java
@@ -0,0 +1,75 @@
+public class sort {
+    public static void bub(int arr[])
+    {
+        for(int turn=0;turn<arr.length;turn++){
+            for(int j=0;j<arr.length-1-turn;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+        }
+    }
+    public static void printarr(int arr[]){
+        for(int i=0;i<arr.length;i++){
+            System.out.print(arr[i]+" ");
+        }
+        System.out.println();
+    }
+    public static void select(int arr[]){
+        for(int i=0;i<arr.length-1;i++){
+            int minpos=i;
+            for(int j=i+1;j<arr.length;j++){
+                if(arr[minpos]>arr[j]){
+                    minpos=j;
+                }
+            }
+            int temp=arr[minpos];
+                    arr[minpos]=arr[i];
+                    arr[i]=temp;
+        }
+}
+public static void insertion(int arr[]){
+    for(int i=1;i<arr.length;i++){
+        int curr=arr[i];
+        int prev=i-1;
+        while(prev>=0 && arr[prev]>curr){
+            arr[prev+1]=arr[prev];
+            prev--;
+        }
+        //insertion
+        arr[prev+1]=curr;
+
+    }
+}
+public static void count(int arr[]){
+    int largest=Integer.MIN_VALUE;
+for(int i=0;i<arr.length;i++){
+    largest=Math.max(largest,arr[i]);
+}
+         int count[]=new int[largest+1];
+         for(int i=0;i<arr.length;i++){
+            count[arr[i]]++;
+         }
+         //sorting
+         int j=0;
+         for(int i=0;i<count.length;i++){
+            while(count[i]>0){
+                arr[j]=i;
+                j++;
+                count[i]--;
+            }
+
+         }
+}
+
+    public static void main(String args[]){
+    int arr[] = {1,4,1,3,2,4,3,7};
+    //count(arr);
+    //insertion(arr);
+    //select(arr);
+    bub(arr);
+    printarr(arr);
+    }
+}
diff --git a/Arrays/spiral.java b/Arrays/spiral.java
new file mode 100644
index 0000000..fae4499
--- /dev/null
+++ b/Arrays/spiral.java
@@ -0,0 +1,48 @@
+public class spiral {
+    public static void printspiral(int matrix[][]){
+        int startrow=0;
+        int endrow=matrix.length-1;
+        int startcol=0;
+        int endcol=matrix[0].length-1;
+
+        while(startrow<=endrow && startcol<=endcol){
+            //top
+            for(int j=startcol;j<=endcol;j++){
+                System.out.print(matrix[startrow][j]+ " ");
+            }
+
+            //right
+            for(int i=startrow+1;i<=endrow;i++){
+                System.out.print(matrix[i][endcol]+ " ");
+            }
+
+                //bottom
+                for(int j=endcol-1;j>=startcol;j--){
+                    if(startrow==endrow){
+                        break;
+                    }
+                    System.out.print(matrix[endrow][j] + " ");
+                }
+
+                //left
+                for(int i=endrow-1;i>=startrow+1;i--){
+                    if(startcol==endcol){
+                        break;
+                    }
+                    System.out.print(matrix[i][startcol]+ " ");
+                }
+                startcol++;
+                startrow++;
+                endrow--;
+                endcol--;
+            }
+            System.out.println();
+        }
+    public static void main(String args[]){
+        int matrix[][]={{1,2,3,4},
+                       {5,6,7,8},
+                       {9,10,11,12},
+                       {13,14,15,16}};
+        printspiral(matrix);
+    }
+}
diff --git a/Arrays/spiralmatrix.java b/Arrays/spiralmatrix.java
new file mode 100644
index 0000000..2ff06f7
--- /dev/null
+++ b/Arrays/spiralmatrix.java
@@ -0,0 +1,48 @@
+public class spiralmatrix {
+    public static void printspiral(int matrix[][]){
+        int startrow=0;
+        int endrow=matrix.length-1;
+        int startcol=0;
+        int endcol=matrix[0].length-1;
+
+        while(startrow<=endrow && startcol<=endcol){
+            //top
+            for(int j=startcol;j<=endcol;j++){
+                System.out.print(matrix[startrow][j]+ " ");
+            }
+
+            //right
+            for(int i=startrow+1;i<=endrow;i++){
+                System.out.print(matrix[i][endcol]+ " ");
+            }
+
+                //bottom
+                for(int j=endcol-1;j>=startcol;j--){
+                    if(startrow==endrow){
+                        break;
+                    }
+                    System.out.print(matrix[endrow][j] + " ");
+                }
+
+                //left
+                for(int i=endrow-1;i>=startrow+1;i--){
+                    if(startcol==endcol){
+                        break;
+                    }
+                    System.out.print(matrix[i][startcol]+ " ");
+                }
+                startcol++;
+                startrow++;
+                endrow--;
+                endcol--;
+            }
+            System.out.println();
+        }
+    public static void main(string args[]){
+        int matrix[][]={{1,2,3,4},
+                       {5,6,7,8},
+                       {9,10,11,12},
+                       {13,14,15,16}};
+        printspiral(matrix);
+    }
+}
diff --git a/Arrays/stocks.class b/Arrays/stocks.class
new file mode 100644
index 0000000000000000000000000000000000000000..1bc9dd930daa4fdc9c7349127f2e2635331e3e17
GIT binary patch
literal 692
zcmZuu%Wl&^6g?9^CU%@OZJJO>LMc$NgVcx(o2F%fgcOuwq@YSxR}*Ix+&XsUIEb!b
z!IyN?4I5ZMg-}0$U*JzzG+d`e5fYpGnsd)R_s-AD?-u}`!ZDG9!l7Ewpfi*Y#aq!1
zMKo%=gG1@340<Psf^?Tbv7LR6Jj3z=)QwU(l8N$uHk+9!z~U%cC}D}Av_S2N^bPfo
z#XAPg?slE7fn}_4R4lBb`p?+@$t0CyLdR1YUhU0Ug1G%E38J*0CQ^*IP29j5$4v{j
zP$z|xH1>}sgdR*!L^PbpFg#8IU;eFY_5sZ_(Zp?zbqjZ}!BF`RGXtl_C=DY9)$Tg`
z<etSt$*|N5BKdMU9?0ai7=%<Q_EX^>?TO>-Tpf#m+G_T}mFD>oNpKL2wlgBLA5Rls
zJ`b|y!j-hGOanG(og94!pnwhpo$Ou8n&cUIt@RD;GX)Iy$Y#%3Y-HP$&!8WuRU`j+
z#pozI%5JlDaf;1)tGRWGRkHQr6SYxQ&tdMIfm5OLQDJAZUyV=Hl$+DGU{b8ki82jE
z<mqz^8e!6i0ye4QP`!-`?h~>I^%9&h)>MAeY=Zy~uGPFCnrxv~S^r^rN}0Q!s=A(*
pcRgKqJzgf0=Wg!{%8$-b`-;Y5yAlZiYFMYEI9Mabhm_}F{{d)ngjE0l

literal 0
HcmV?d00001

diff --git a/Arrays/stocks.java b/Arrays/stocks.java
new file mode 100644
index 0000000..04c9b95
--- /dev/null
+++ b/Arrays/stocks.java
@@ -0,0 +1,23 @@
+public class stocks {
+    public static int buyandsellpricestocks(int prices[])
+    {
+        int buyprice=Integer.MAX_VALUE;
+        int maxprofit=0;
+        for(int i=0; i<prices.length;i++){
+            
+            if(buyprice<prices[i]){
+                int profit= prices[i]-buyprice;
+                maxprofit= Math.max(maxprofit,profit);
+            }
+            else{
+                buyprice=prices[i];
+            }
+}
+ return maxprofit;
+    }
+    public static void main(String args[]){
+    int prices[] = {7,1,5,3,6,4};
+    System.out.println(buyandsellpricestocks(prices));
+    }
+    }
+
diff --git a/Arrays/sub.class b/Arrays/sub.class
new file mode 100644
index 0000000000000000000000000000000000000000..83f54713c9b2faddd102bc3c5c0cf662c922ea42
GIT binary patch
literal 1101
zcmaJ=+fEu$6kP}Ag5#)o!AlV@t+s%zRNL}`HH{=j5|kzw8{$h3c%maPLzsh!?|wv|
z+lM~a2W?E_2lS<%(Qjze+a88QjHJoToW0N4Ywf+)+4J?!)ir>1qzwcR)S;MAp)rJy
z`3X<exP6!^l#fM4GH7d-ZOL_pU_7zchY<R77$*8*-U=_Cx>D3B%4rcOl5Z1PPU>~j
zvSm>=1+QmDDCeMwA%qzw>bxqlj$PsMjU|uBawWH=OW1fW;ltZ?5Z1B}GX_R5s$<MV
z1mg^&J@^^ahL_EwxJ!`O^C%`wOnHs!?Z}#KAc|=nF%vVGrRv>QnIUjkA+Gp-F0sd;
zWSs-SFqF4!vD2!TMRS*zYqT>^l)O^i=8cZ8)VXCdjK}wTC1)^-PODiFo0bO-QKDt9
z2NH3^ailAoys<6hk#pb<X-F7IVoAqiPpu~m3pe*-*(Xj_q<mR?0XKO?I?Yptcinw=
z0)5ggZXeWyyO4LBYO9gCTVdDEE#U5HL-Yvm?$Mu=O!uXAD6+g(D_T-yLP(LUY>vUq
z*|unAYut5(t7Da6@lJ2OO4jk5Vdnp#G^~Dqn5SzE(6j+T&{aaC?;LqCS{bcs@)GP5
z8H_^FJ_Z5$yea5}o)c7~vqEq!n!J9GT=ZpBdAlC-?3GwrnNF(_HKKgL<T><YL|wkZ
z0C0ifGnIY(`<*r~FmV<n`&-9mWM6to1MQ@%Fv(Wvk5XY!sxj!8Aa9<^cuH%U{;@UM
z-yq&Cirb-4xK9Y0-(RHVZ}c<&^Aph@=%<H(53taw{}n+z3Fbmyj8af7loY*CQo~xI
zq=iF;k{&h+`K8aecca1}bqoxXbR(p~D0z$I2k;P&Xbll>oZe+B4pcD13ZCHwrv3pp
CngF-}

literal 0
HcmV?d00001

diff --git a/Arrays/sub.java b/Arrays/sub.java
new file mode 100644
index 0000000..73ef571
--- /dev/null
+++ b/Arrays/sub.java
@@ -0,0 +1,20 @@
+import java.util.*;
+public class sub {
+    public static void gc(int numbers[]){
+        for(int i =0;i<numbers.length;i++){
+            int start=i;
+            for(int j=i+1;j<numbers.length;j++){
+                int end=j;
+                for(int k=start;k<=end;k++){
+                    System.out.print(numbers[k] + " ");
+                }
+                System.out.println();
+            }
+            System.out.println();
+        }
+    }
+    public static void main(String args[]){
+        int numbers[] = {2,4,6,8,10};
+        gc(numbers);
+    }
+}
diff --git a/Arrays/trap.java b/Arrays/trap.java
new file mode 100644
index 0000000..6de4d6a
--- /dev/null
+++ b/Arrays/trap.java
@@ -0,0 +1,32 @@
+public class trap {
+    public static int Rainwater(int height[]){
+        int n=height.length;
+        //calculate left max boundary -array
+        int leftmax[]= new int[n];
+        leftmax[0]=height[0];
+        for(int i=1; i<n; i++){
+            leftmax[i]=Math.max(height[i],leftmax[i-1]);
+         }
+        //calculate right max boundary -array
+        int rightmax[]= new int[n];
+        rightmax[n-1]=height[n-1];
+        for(int i=n-2;i>=0;i--){
+            rightmax[i]=Math.max(height[i],leftmax[i+1]);
+        }
+        int trappedwat=0;
+
+        //loop
+        for(int i=0;i<n;i++){
+            //water = min(left max bound,right max bound)
+           int watlevel= Math.min(leftmax[i],rightmax[i]);
+           //trapped water = water - height[i]
+           trappedwat += watlevel-height[i];
+    }
+    return trappedwat;
+        }
+        public static void main(String args[]){
+        int height[]={4,2,0,6,3,2,5};
+        System.out.println(Rainwater(height));
+    } 
+}
+