From 9acc631e2b7a4d5aae2fee415f666add687c4f23 Mon Sep 17 00:00:00 2001 From: Mayank Date: Tue, 3 Nov 2015 15:46:08 +0530 Subject: [PATCH 01/32] Initial commit --- README.md | 2 ++ 1 file changed, 2 insertions(+) create mode 100644 README.md diff --git a/README.md b/README.md new file mode 100644 index 000000000..efca67af5 --- /dev/null +++ b/README.md @@ -0,0 +1,2 @@ +# Algorithms +A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute. From 3a1818dbc9a1497e9acd3709317a061930f02e1b Mon Sep 17 00:00:00 2001 From: Mayank Date: Tue, 3 Nov 2015 15:53:46 +0530 Subject: [PATCH 02/32] Edit Distance completed --- editDistance/CODECHEF_seatsr.cpp | 78 +++++++++++++++++++++++++++++++ editDistance/SPOJ_edist.cpp | 42 +++++++++++++++++ editDistance/a.out | Bin 0 -> 13600 bytes 3 files changed, 120 insertions(+) create mode 100644 editDistance/CODECHEF_seatsr.cpp create mode 100644 editDistance/SPOJ_edist.cpp create mode 100755 editDistance/a.out diff --git a/editDistance/CODECHEF_seatsr.cpp b/editDistance/CODECHEF_seatsr.cpp new file mode 100644 index 000000000..549f90ee4 --- /dev/null +++ b/editDistance/CODECHEF_seatsr.cpp @@ -0,0 +1,78 @@ +// Two 1-d array implementation +#include +using namespace std; +const int inf=0x3fffffff; +#define Min(a,b) (a>test ; + while(test--) + { + cin>>a; + cin>>b; + cin>>z; + cin>>x; + cin>>c; + lena = strlen(a) ; + lenb = strlen(b) ; + if((lena-lenb)*z > c || (lenb-lena)*z > c ) + { + cout<<"-1\n"; + continue ; + } + if( (z == 0) ) + { + cout<<"0\n" ; + continue ; + } + if( (x == 0) ) + { + cout< c) + previous_dp[i] = inf ; + else + previous_dp[i] = i*z ; + } + fr(i,1,lena+1) + { + alpha = Max((i-c),0) ; + if( alpha > 0) + { + current_dp[alpha-1] = inf ; + } + alpha -= 1 ; + temp = Min((i+c+1),(lenb+1)); + fr(j,alpha+1,temp) + { + if(j == 0) + { + current_dp[j] = i*z ; + } + else + { + current_dp[j] = Min(Min(previous_dp[j] + z , current_dp[j-1] + z ) , previous_dp[j-1]+(a[i-1] == b[j-1] ? 0 : x)); + } + } + fr(j,alpha,temp) + { + previous_dp[j] = current_dp[j] ; + } + } + if(current_dp[lenb] > c) + cout<<"-1\n"; + else + cout< +using namespace std; +#define Min(a,b) (a>test ; + while(test--) + { + cin>>a; + cin>>b; + lena = strlen(a) ; + lenb = strlen(b) ; + dp[lena+1][lenb+1]; + fr(i,0,lena+1) + { + fr(j,0,lenb+1) + { + if( i == 0 ) + { + dp[i][j] = j ; + } + else if( j == 0 ) + { + dp[i][j] = i ; + } + else + { + dp[i][j]=Min(Min(dp[i-1][j]+1,dp[i][j-1]+1),dp[i-1][j-1]+(a[i-1]==b[j-1]?0:100)); + } + cout<Pnm3MlAO3{oF|H;EH)I$ zk&m7nAgK*mX<1pRvCV-y><@1!umMAspc@J=Lv7j4;tWVJr&x=kO$#Ai1}Sm^H%(JD zO|1RSz4wrhPh=N#!2X%8z<2KX-E+=8_q_Y@?t52X?&{fB<#Gv5RpRr4xC^yG38^di z2FYryO{@|@u}N$cD}dDC7nCJLRgUR`HqEqF%eg_T@oTG6KwDK%W|)3b!GbA!NR;X; zrl8I$def&^rb757Kziis!lxt)Iw&(tzpDKZsd^=#^#~@t`b`S1-!v#QOlQb25>sv; zwT*rQ+U`JA5FGJABBE1XirrBrpEWV)IvCdg*gNss8$fr>V??AK6gt@}ZknOAL^p@MND|S+%|E`#tN= zujwGHTp~aGWePS|z|R1`vy6Ncj+Db6u7I~xus>J9es2Xkhbq{4u7aJt73}P+fS;;h z=bOOSi4EeUe-JtJf9O++<4195)bj&jl(wLp=UaSK3KS0AtzSdK?bIGc%uN4p2ifkv~df4AA&--4DvH<9iB?W!rQ8X17%F0=QK zB2uq4lFC`qy;LIGHAXRuaJUeu$m3>YTxt1-MF87=tv@h|;whKmJn^F7Uf>FKHY#;#U`sucZ-u zTw}R=;;U#RpVar;g%L|xlBZBK$GrJK*#`sIM*ObWOuB|9q+;%Un-pxVe zh##TCxtT?zZTApQA)LD*`8$cH>3VKj@~eq=6aRwbtB9u%&RvlF2X}*~(9NBd{JX@{ z?VUR*`L~FtP|c+!{|50CqPaoI|A=_>Au-o0`R@@=p_&VVZ+g2s|Jq|l{taXNKX3I8 zbYGwD#foTLzcS+?a{bv=K{2}@g6|D`H+Kqg@hb?_VWWZilQF*FG4gL7-*^$$WO&vc zy-Wp*GY~#apg4MsqB0y{{t}fRHcq`G4P3eHh5;jg%eXST*KoaTyms4KU$AxuTk~#) z9aaCyKm5W5zYw`~hoLx|gkwivuGt63^$S_kWgi|OjPbo9S2O?T&?^}GIVmjOI6C(P zbSQ6}y7|Idw}={()!VkiQzPHC&@^pKP4vF|;i8d$S+->M)!U1U#-zfgdV!yl#S_!s zbJM4%y{9K|r=WAet}{Y9uyf*e(awOvj@aeW3LCUzk1A}$ju{G5bzGnQ^+zzDpEyY( zT+8*@pDFaKgifl$ofDGFUj-m5_C9|DS!w%$t6$!ZycF1}#4E@>Rd;CwUE(s$6tknK zW$ug{ZPq3yrgL?d5{2>uRGv`fvRx<-LRLDf{rQH`bi>#IPtIwlu2Qt6`GZiul%fup zzdq|CTYj>2eIku!QFmgO$ERJ!9*I8H3rsah@$12pxN*JuUuPap2;A@ii7FyEtVs+kUc4O>vm6PYBi5+OcjTfbV6Vry*06TG(Tp0fj z5%JXBP*A|Ei~O42ia`RujPd6PcA;3_iK$*>r(|n%BV4Z-RQUr}4evoRd!Ed)F%;w{ z#uOsS9$D_4`YHK7{vEZEctGXgj$w_t&be5*vq$lR75a2|(U&pQ*WE zt4TtqYp9R6U9nc73cB6%HEO)MsLK_tt&z2`8?Gx{IN7Q~ul;k~G9I{sc3zRqJw$!g z?j`OJv937}LWeRL&~oj6l6tn(L_4T`%ocC8G&KJTZZ+lPozu5K-D*OgYGJ)e)sqU{ z^lv{vH~kacO& z`wps|2g&QdhV&O9tpY!JU?FO>tdSEM7OQtq`fu0dY&U+>mw)oZd~RX<$q!w*&zyR4 zVG-@lZMuBx%$S%x48a%2Fg0Hy_A)(v&W3@VRoa(G_Oc6cntdL@my@xY-$M_F9t!0b zLx)2HJyY9Oc>S2%ry4w<{oVQZyYt^~`f<;WH{~jNp@Tct)Be* zov^T2_qs8D4PAXc_ZBU%UpyLmG;}odSjfC~wzz)$;u`gAtjT%_rspRbNexY_MdNC* z8XITf+UVXBgs-$HCQu>mIX;WVJPNuM!TTprAC&$B^dRVapb5}AH1KuMM?vd=QF1-e zCtPDb*Tyv~YtOn?`Us~z^DD4>9|`DGUS5cMQBLwd{MF*(G|75=`#kjzdhhtt+LL1M zJ$vqJxpynUB-4rCF#LQ6Yl;YYd{0+(tX<)rt47tbJPNoKYr*G13*{%MROz1v?L+x` zdwH)aC)?k|uNUPpDsT7rzFyVtsei`ZdMZR0Bsd4g$ATgcNG z@@#MS_#p@Rc2BL0%T1_{!45sdET`oNEJt8D0?QFtj=*vRmLsqnf#nD+M_@Su|KB5! z#(PsrS3QdMYF>i4&|aF7lhU^UN^2Am(<_5Aw^s85cR(O!|#FK;iVh@P(s5-EK19jsQo`X-2dZk6Ks-THa$AHP$thb|?#=TupF z#cMm2@J@je?-gscKJS9Tn7d_bu@&+bK(rqyckbNMQ} zh^lqOg|~K2|7rcG5^Kc`$Gj2HxX-a(g*5J5#~udm!fN!w))Ei(FOBCEaH^Nr zN7AA64g6d<`M~R$1aY~DU%7U@D&;o_dRY-_&S_^8g%rZpH`56w}SmO zZh9758vhNz*HzUQ&i$}!+XydnzUL3LJbjz7r*17zUpOiGcBv=E!@%i2(&u|h@?Aes ziA$*D@(;j$sFyy++tZ5`RnGbgKnLXY812_>?JoscOwa?7P!d5mDh@{i<2vbj+X~t9XVaI%=rzM^o2He_Y(y1hi z4o$&OJe-I>0S@QC!pSI(c;T@u7m<8pJTA=rJ%`#uJy6LFncZe2m&w3AGl~k#eSM(= zU1rz8PC7Ft!=>|D=g_`={arYa6>9J4B8d{eqosg6dnU}zFB}XV=|2hD#UY5EmWYvY+>Ilq|JQ z=iVIFf7_9|-|gU`2rJEePK|L=O9&sifLtqb?P^hjQ@m951id=B+kGAiu- zxo{@YDJP%fvwAaNlA`|Zm_*}DJ z<4pK@hWRFB?E1Wau(ZK@Sx{4_ekbtvu{Y-W&sPPdk~^d?7xP^6UdOOtk3(UwAMGYpfi5l{?l5&UCZ(N zkBeHL-pugGVxq+h`>$#J0>!yg&|!s!N_h~wKJU|JwEnb~W5Vy3nEr)B zpPv&iXh*-rj%fp|$M*ixq0jri0evWx-}A7%)Bg)vpX1NZZG&3>E>_gkssDElef~cH z{{Mi^|3UxT4t?HlUexusIyx-hKQ=p!j0Zm&1C;prp8sFK884^)tI(mUSfBR|wVTLV zvA-y8DgQ$hkc+I(`$XTz)c*-|=@zp-?}zKP{)}!vcLVmH+x1_L`gz~Huo(qNEU&mC z&-gqF?EV+_*M6muW<^a|kLi2B?fSf5O8b=p`>EBJ`11h@$QHMspIcA*mBv_tN2=mA ztQcHr!%p=#77&$T{XPdyvXq#vL!RrF1^V(mzsm6Z!DXyx=XvZfMs#M2;?C=N;8S2} Yt>L(Ft7v?dtAA{V(*KNOz&Y#xZwceRJpcdz literal 0 HcmV?d00001 From 06e229ac6edd3f4e26eed41410619fe292ec7d5e Mon Sep 17 00:00:00 2001 From: Mayank Date: Wed, 4 Nov 2015 01:07:31 +0530 Subject: [PATCH 03/32] Binary Indexed Tree added- Part 1 --- binaryIndexedTree/SPOJ_invcnt.cpp | 78 +++++++++++++++++++ binaryIndexedTree/binary_indexed_tree.cpp | 76 ++++++++++++++++++ .../SPOJ_horrible.cpp | 76 ++++++++++++++++++ 3 files changed, 230 insertions(+) create mode 100644 binaryIndexedTree/SPOJ_invcnt.cpp create mode 100644 binaryIndexedTree/binary_indexed_tree.cpp create mode 100644 binaryIndexedTree/range_query_range_update/SPOJ_horrible.cpp diff --git a/binaryIndexedTree/SPOJ_invcnt.cpp b/binaryIndexedTree/SPOJ_invcnt.cpp new file mode 100644 index 000000000..d15385bec --- /dev/null +++ b/binaryIndexedTree/SPOJ_invcnt.cpp @@ -0,0 +1,78 @@ +// Solution to ...https://www.hackerrank.com/challenges/insertion-sort +#include +#include +#include +#include +#include +using namespace std; +#define lli long long int +#define Min(a,b) (a s ; i--) + +//lli sum( lli index) : returns of arr[index]+arr[index-1]..arr[0] + +//void update( lli n , lli index , lli value ) : adds v to arr[index] + + +lli T[100002]={0} ; +lli sum(lli index){ + lli sum = 0; + index+=1; + while(index > 0){ + sum += T[index] ; + index = index - (index&(-1*index)); + } + return sum ; +} +void update(lli n , lli index , lli value ){ + index++; + while(index <= n){ + T[index] += value ; + index = index + (index&(-1*index)); + } +} +void binary_indexed_tree(lli *a, lli n){ + lli i ; + for(i = 1 ; i <= n+1 ; i++) + { + T[i] = 0 ; + } + //To be Uncommented as per the need + /*for(i = 0 ; i < n ; i++) + { + update(n,i,a[i]) ; + }*/ +} +int main() { + lli test,n,i,j,inversions,position,option,ans,p,q,v; + lli arr[100002]; + lli brr[100002]; + cin>>test; + while(test--) + { + inversions = 0; + cin>>n; + fr(i,0,n) + { + cin>>arr[i]; + brr[i] = arr[i] ; + } + sort(brr,brr+n); + fr(i,0,n) + { + position = ( lli )(lower_bound(brr,brr+n,arr[i])-brr); + arr[i] = position+1 ; + } + binary_indexed_tree(arr,n); + ufr(i,n-1,-1) + { + inversions += sum(arr[i]-1); + update(n,arr[i],1); + } + cout< +#include +#include +#include +#include +using namespace std; +#define lli long long int +#define Min(a,b) (a 0){ + sum += T[index] ; + index = index - (index&(-1*index)); + } + return sum ; +} +void update(lli n , lli index , lli value ){ + index++; + while(index <= n){ + T[index] += value ; + index = index + (index&(-1*index)); + } +} +lli * binary_indexed_tree(lli *a, lli n){ + lli i ; + for(i = 1 ; i <= n+1 ; i++) + { + T[i] = 0 ; + } + for(i = 0 ; i < n ; i++) + { + update(n,i,a[i]) ; + } + return T ; +} +int main() { + lli test,n,i,j,query,option,ans,p,q,v; + lli arr[200002]; + cin>>test; + while(test--) + { + cin>>n; + cin>>query; + fr(i,0,n) + { + arr[i] = 0; + } + binary_indexed_tree(arr,n); + while(query--) + { + cin>>option>>p>>q ; + p--; + q--; + if(option == 0) + { + cin>>v; + update(n,p,v); + if(q != n-1) + update(n,q+1,-1*v); + } + else + { + if(p == 0) + ans = sum(q); + else + ans = sum(q)-sum(p-1) ; + cout< +#include +#include +#include +#include +using namespace std; +#define lli long long int +#define Min(a,b) (a 0){ + sum += T[index] ; + index = index - (index&(-1*index)); + } + return sum ; +} +void update(lli T[] , lli n , lli index , lli value ){ + index++; + while(index <= n){ + T[index] += value ; + index = index + (index&(-1*index)); + } +} +lli * binary_indexed_tree(lli n){ + lli i ; + lli* T =(lli *) malloc(sizeof(lli)*200002) ; + for(i = 1 ; i <= n+1 ; i++) + { + T[i] = 0 ; + } + // for(i = 0 ; i < n ; i++) + // { + // update(T,n,i,a[i]) ; + // } + return T ; +} +int main() { + lli test,n,i,j,query,option,ans,p,q,v; + lli arr[200002]; + cin>>test; + while(test--) + { + cin>>n; + cin>>query; + fr(i,0,n) + { + arr[i] = 0; + } + lli* T1 = binary_indexed_tree(n); + lli* T2 = binary_indexed_tree(n); + while(query--) + { + cin>>option>>p>>q ; + p--; + q--; + if(option == 0) + { + cin>>v; + update(T1,n,p,v); + update(T1,n,q+1,-v); + update(T2,n,p,v*(p-1)); + update(T2,n,q+1,-v*q); + } + else + { + ans = sum(T1,q)*q-sum(T2,q)-sum(T1,p-1)*(p-1)+sum(T2,p-1) ; + cout< Date: Wed, 4 Nov 2015 02:09:08 +0530 Subject: [PATCH 04/32] Reference File Added Resources for detailed Learning. --- binaryIndexedTree/Reference.txt | 3 +++ 1 file changed, 3 insertions(+) create mode 100644 binaryIndexedTree/Reference.txt diff --git a/binaryIndexedTree/Reference.txt b/binaryIndexedTree/Reference.txt new file mode 100644 index 000000000..e7a6004fd --- /dev/null +++ b/binaryIndexedTree/Reference.txt @@ -0,0 +1,3 @@ +Here are some websites/blogs which inspired and motivated this concept in me. +https://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/ +http://zobayer.blogspot.in/2013/11/various-usage-of-bit.html From 40b4084c7158da2777f07d06d116f431c28a81c8 Mon Sep 17 00:00:00 2001 From: Mayank Date: Wed, 2 Dec 2015 01:24:08 +0530 Subject: [PATCH 05/32] Shortest Path Algorithms added --- Shortest_Path/Floyd-Warshall/a.out | Bin 0 -> 13584 bytes .../Floyd-Warshall/floyd_warshall.cpp | 57 +++++ Shortest_Path/dijsktra/a.out | Bin 0 -> 33192 bytes .../dijsktra/dijsktra_implementation.cpp | 230 ++++++++++++++++++ binaryIndexedTree/SPOJ_ctrick.cpp | 116 +++++++++ 5 files changed, 403 insertions(+) create mode 100755 Shortest_Path/Floyd-Warshall/a.out create mode 100644 Shortest_Path/Floyd-Warshall/floyd_warshall.cpp create mode 100755 Shortest_Path/dijsktra/a.out create mode 100644 Shortest_Path/dijsktra/dijsktra_implementation.cpp create mode 100644 binaryIndexedTree/SPOJ_ctrick.cpp diff --git a/Shortest_Path/Floyd-Warshall/a.out b/Shortest_Path/Floyd-Warshall/a.out new file mode 100755 index 0000000000000000000000000000000000000000..162a7202c3524a91bb5bbb22b6a15d741f901308 GIT binary patch literal 13584 zcmeHOe{5UVb-pBJTZtV?a_vNp8=Fy`)=n!{lx0m$u!NLE`6-ZXRg#k|jq^m2l*NV; z1@h66gJzW>D+{5jbF*ep(*!fNVF-qz&4#pa(;}8^FLJQ}Q#+&$wyZGPBp?%aa9c0a zQYYMZ?z@M4d?F1m!~Pj`g~xNxch5QZ-t*r5_1@7}f<0YMheL33ihBfclhu9+nZH7u zY?Q3R+QbdQFSd!TVl9w0xcst&sF`EBtV}blR&p-TDqL+&6KHe#Wrpb|O;|AH780fU zipj6CCf!kIvP^~WNPzUHt;@Gb7IaW%m_DW2F;9(>$s>OWCcXM?k_8=<8KxIi!mes=3ae|zwyzna{;naXa$#rI8!T0EwkB<2QA?n(XmI_K>l zUb$gs@b#X}a~nDURZP?#Pnpu~74TmH-&jW8j|P>)cUQtI*gseSZ>V7B=?d*}SCBtm zLH_v)`0s(&i7jH%Gl(3Xci5%$0xs(BxS9_LqZGqMc&!buf*#p9b^9PnQLgL=JTECD z68`LG=^1Gix_)FdF{Y=CP}0zKq2G5@?~5LZrHp8@BOXenqA8(w5A4??(WHV0_IJb+ zW6^=oP&{gul`nbdK)=xzOQiInP%7HeJr*-MeZiwb2cC$hg1udR{fT}(D1lfq73_-@ zvlGbn8!geXNW44TZ}@!Skx)`MlA)N9>JA5keZY3ZZY-=PQbsZw8top?2b%O?e=GX1 zvgQu6=6+*$I5uY54kyxv6s5*YkXyp+5jZ3Ks2(19R38q-;&4%TBBY0m=tK+}I!P*j zjfP-tUr%>?hu-XMDdd{Hd(8ZU59+&to5_iBMx%+wozwP5Er|=i1?Rb(aLt0lA%)ay!EY>} zLOf`}*IV#G3%Zc_3$5>K}&H!gW6@#MPPpyWTe1w6Sd*DLwo5>Kwm`N8{s-JSW#BU-{3T4}w>QYqoa^ar#f-s6$#KJx|)yvRli%eRS(-Sd;Fl zJA8%;@)sd|fBf%ls=;en>n1@6y1+M=lu9GMBZ5?7f=fRqZDq8Ji2%*0Z&m z?XY9kKlz8pwsJC9MJBEfGes#?-Ajj`yO=oJcLC~h|73nqa{TcKM#(qNz`K80T z$Du=cE%QV+lYVP4c!kRyOfaiC&cd`dr_F4Tnd{WJN*YyXHOIpLpc+=%yHGRx zEwto1RcALiuT!$nmzIyym)T8gXM)tm%%+8@;8jQNJ0IoqQ^93N?rE91;>aCE=H%gX zbbI=>u{=-GsFoo}yy6L;v28>Z-u5IIjws=C?pq@-g3y$2wc!Z~-mtbJO17VocXD=`T$K5lmRZb3=x)xKqNr5MJR`LV z9je2)vv=s-56X1tb%15s9=>qxMqkioo|E3r-bOXeX?xGrd;_jD{2$Ahx^?LP$83yw z>*?OnI-RXSuU?^@Ao*$|nA|^Mz?f6q%;9WA+xx70k?q*?stA;DNyXflNMdC@|17d&kW+9!&PLjoU!`yEE^1XI}UHYtOE? z<*K^yp)315+MrGU+StbHLr>=2p3M85u#n&MrZ#oXq3wMy{VpxIUpyRmIB+=dNI*Y# zvRLEq&fz}M8m*RO+D|#Qy6)~pOKH)Iqk`u^KZmZwK^x$;w?OIProHk;bm4QLv^MsD zMnTV`{L7$m@RvYe0;Tg3CCB4^!ZA_n*t%g|^-0INTEgj!d>ZxKNdhXBmlt9O%1Qph zf9CV^BFl^^Z5Jw5lYv9^Y?%j8*m_s({=2Xc^acUMdQwxAzPutS@p)wJq?RS&FsVATVw9$59jss~m*uN|ng4Ub-?8l#{Y>50cNBeJ(Y1IlL+NHkKdor1qFsvKujsI%M-`RI zmY;nc9d~(l9vVuI8EMZRZ?o6e*xa0!Z1XM?@H991_V}87O`=4&#k<$r+~{jEg?+wV z9*GFyO&uFGLPMZN(xfAti;dy?;<)gRC5)&y(B9o>gpMfg$XMDtl#bzpb}S;i#Epbf zBf=XwHU@hpHIin@(P%OiON^B;I?9sKc!(5KZai)XZwwzGg%=<3@H-3!Wr;}02nla= zL?2FuMx**j1iH+b8hR+13>`ByIRB+E#9%!%8VjT91PtQGD{C<=4y97U8%~UlM#l_` zk1J(e7~O47|B7N4M#Df^+$D^%cvWGXT8+6dYI%H?;%o7R$!~>Z-X+$Fa?ihuW(75F ztV%AtVdL>vir-imr=|G%!hBVVZxHk9`7Xt8D#XE*;%>q7Tq#~7de!__iq{H`-zdfF z#0zERHx}m2Qu$95=F3uilc3K|_T<8>S8jZ}#La@g(^_?0G|Q>^uoSNs<7M$;yg;cu z&+bK(rqwF(8~H(`hzddLhy!om?Cq!Z!-+4&FWTk}ufi|e@PNYY>(~R*{uc3K!yt0S z^=w$?SNd}nIMvJRBk553CN2je9(X;IAbw8cD%Y=nl=52yz09UW{ipOVxXAvnT6g6; zPhdAffN)-qdA%aNa`x$6r2~-`o;p7yim6@VEB#3lsH{Tge+0@JrIp z%JKVKiCZn0`CHHcigU52)(Uv9!s+{kHKl=jtbodY9e5q0nRwo)QuwI~@-G9gE#uEc z;0^HG57cwT`=57!lRuBD{hfSQk2)OK0M$9`3-LbOH2Th1E`Dc+lBX{;*5m_D_UUsy zrKtSHYkc6fmUtosi~Ulbxgw2Kz>inJ=al`^4TD7^$UR>{{)ZLte^&Uo?S5^=jUYcy zdP?m#0H^*^TmmKeZ3FZ(5-+p9gp)?fNDmKt!-(OzucJ@z>Fysu#8WY_NjFCIFoiay z1V=PkAYG3n^ds@aP$;fPj6^b}htd-Qi~M*zYD6R6KiJdS2FqoHblPs1n+F{mg5)t_ zZZ{(7(a~d2v2Z%=Qc6YRiDMD{u~0HK5{k#Y;qh@9zSPsE>#>B~)94Si_;dEUq`^2+}~9Q11npJ8U9A$T&fuHTolD+4gIo} ztPC=v@HU(EYevo;M2{k|F+H7%!c`>7k6meqonGQ9MAi9P#?qtFByM*+HcAn3vEc5} z(1Z-GyT;9gRlb!JTt@+Lw&v=QR6-xYLqm~$W}q9n-+at;>}m`5pfp6T=$aN8QfG$q z*^H~WzX=)aQM4%}x+EqVxh@j1WRPNekFrV31IivjVe(0Qyr3`xsGx7eO zM#Pax9$xUeJ?^!c13BjSMb z`vqiWQs$Tyk03{9d#<0)GjFajMH-Z(Vhi=K{G%wRcLmIgwSH4Wz3}K&`oxk9w_m~H zab(D+tk378UZt-oL9Umo&t>yUf8HvLe68Y{egnK!pZANCs-b7OVKzO*if3*5e9r4sL8AO#hvn_< zKc)0}&&d0_UZroBXP)T`N}ul^pBo31{s333DC;r&eVaa?FJDmlU$#B4eE(Q~9vL?- z8UvJgpU?jvzoL88601I+ zyT?7I3b&IDupaXtAVV1UpZBkm9#ewX0h1F#!ORLepi})#1;os-exD5|SxQXl-*32X zS)hJ?>M=7se{dP=S$Tf;86$e}c9WY_^T2Ijsg2x!p1){(maBhom#N=q8!-0z{~L$B BcU1rY literal 0 HcmV?d00001 diff --git a/Shortest_Path/Floyd-Warshall/floyd_warshall.cpp b/Shortest_Path/Floyd-Warshall/floyd_warshall.cpp new file mode 100644 index 000000000..24e6cb3a2 --- /dev/null +++ b/Shortest_Path/Floyd-Warshall/floyd_warshall.cpp @@ -0,0 +1,57 @@ +#include +using namespace std; +#define lli long long int +#define infinite numeric_limits::max() +#define Min(a,b) ((a)<(b)?(a):(b)) +#define Max(a,b) ((a)>(b)?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s , i--) +void floydWasrshall(lli G[][400],int V) +{ + int u , v , w; + fr(u,0,V) + { + fr(v,0,V) + { + fr(w,0,V) + { + if(G[v][u]+G[u][w] < G[v][w]) + G[v][w] = G[v][u]+G[u][w] ; + } + } + } +} +int main(void) +{ + int test,v,e,a,b,i,j; + lli wt; + cin>>v>>e; + int ed = 0; + lli graph[400][400]; + int temp = e ; + fr(i,0,v) + { + fr(j,0,v) + { + graph[i][j] = infinite ; + if(i==j) + graph[i][j] = 0; + } + } + while(e--) + { + cin>>a>>b>>wt; + graph[a-1][b-1] = wt; + } + lli q ; + cin>>q; + floydWasrshall(graph,v); + while(q--) + { + cin>>a>>b; + if(graph[a-1][b-1] == infinite ) + graph[a-1][b-1] = -1 ; + cout<hFD? z@AG{B=+T_D_u6Z%z4qE`uf5OShcnx~OBdM;Ls^$i%~O&aSRp8VSE{?iqEMFaWx-RXXbU<_F?PT-{LQjy#4KBdBrG^eqm>0M4GCFa;;Jx{8pej} ztOXTx}o%8WWA7FX@ zsJ8v>4*Qnal|E5>?Cz>alw~>iv-(XbC)_k&aD#!T{OC;sY-9iR(ZGq`-!2_` z%b*27^?Q{=(2zb#DaX|ZeoR03*MaX#PIEu@?*l_)#=g z7d-oH`c9eh`x}~DBK~MB&=&LimA`tke?_Pv9F2wA7BmH-(NI+Rt5z=a*M-_l^vY!m znpz^Em4S^-AzjvY$py=6W3$37QUAt3G&H>`5{@k_^=?*v;9Hua-kL=#YFldkUO|N0 zqTUr@Bx_^SLy@|ss$gxbv^3ZlX!FO~0^wM+D(LmD0B#zDg@gWY! z)|Nr>-qkJ8)z!wP1;Y`M-4w0*a&m(!A$5koW=T-%6l`gaNfp#QOdAF*^TBe#P5xlx zCVzb(+yr|DI|BYdEYuN>spddaQwv1+$za;JIRIrAFRhxtz(3V9J)WBCnW58b*ZQXc zuapi1HjG;Sr}JsRCjMi`8pwOmw;Wd`_{$H6vpM3wX5!jMga>lu?=kz|00)z#=M|fD zJwm8W?K8_yjoBc0#x^q)N#62D&IODU)@At@@wpZfu)y@+0Z5yorPP&#PnJJ132((% zGL$6YljosXN%-VAT#TV= z!ZVIqmv84uhp#LBoikj@cjduYdN%`+Z|5_Pr!5K%PtW)@NKTJ?1^2;YDv)Bnk%h;P zp2juq1?Fku<3}X_6!SFg@q?28Df4#b4@mw2=4s;N`z8Ma=4smFdnEr|=4sO7J0yQA z^EBo0R>@z_Jg42`8zldA=4ra)HIl!A`Ap_3B!4OMG~w|Q1b zW@XjkgGVsq`VJr3AmH#@c@?UA4G2G~A3SEEQjcB-1FrJ9uLkh#JeA|?d}s5>M#Jh-87d}lZ)qAY`6D(ilyZo;r;LsO#2=H~j?>p3euFrVR_wpC9p>b(h zmbAfRAV=4~_wGGoh zf4VOLV^almdAohL_zoRK8xMEerSvHg)mh^>?EQ%5>GFP5?mfA!P|#f!j;>W7`GUXp z9r}~qXB_bzCW+eV{m3}+YL9wLe4X36JKK+St~%Pe?9HxKZ+3Z)cD{;QiqJT-5#2tK zcPvR>m$b=;>LIOHxv85?#2piHuOymek{|sy;u7VSxIMkBMLTwX_<3B@zRcZ&>B$0e z95Ok&yeGx1Hk$PwL7H_*yH07V(O&Gvnly`Ey5Xxm=*1ppRj{b9v;C;Hj53XgENM_e zfZVE6Nbb4NasYP3>z(bdba`Lt^d7_AIJonm(dq3*5((pACzS2-zTTzEz1^2pFo|w) zcCG48wxjA2AJaw4&|^RM9r`0Y;CWw{>Z(Ya{nWM$=zt0=Q74l{o&5hT>ZIs;tlay` z;9U>HvZ4il82`wn*>!O#H3HxBMP z7|WEfaQu6^?R0H)uhm>+Yoyanwe7y0-3|^%pbn}Tk4&1o`-lXX7q4xkN!z*Yb2WI^8JM5?r4wI-aG$fw`#D?i+@ZgYG2Vaqlo`wtZaH}OFXI-J_E9Bg z*D_R`?7{Ii!!tzSp+m>V7|*|as)udsr z7)PLs_w(a_=;>9R?H@r1I=mtgm&MHV4s<2P<$y;y)1OEef9mOXIy@ite$MVhW#!&u z+qMWi8fyfEqPz32WT9xv-aF^?X-sV+`YJrE;J(zk54O(dp5(HxyY(NZPd{;t^ERC4 zH^`hY_U!b2Zk)LM2|lK1q7%TIBd2m@EhfPlIMv;q?RV7qy3)o?q&l76?$U$4&ZAYG z&p@@i=~WMQc^^d0@CKAV@9TWZxAQ5Zs`E(YPox1l@9TW|G07tGVcN6#cGuV+<=iTK z#*xRE{;5#><3r!3gHGS1XHboA=RrH>f19v$dXJzg=>M;O%KY&9VebKQba@Yydmr2u zghEHURvmz6A5Pmta{-~lh9G6;+&zjNWRi8|?*XsOX6+)8~CG&!`yJH$z$2eD9BS}uxNVwT;($~u3^4lCfygk0CE z2PF=?PUOhXBxv1;pfz~cDF_hdP%r`o=!&DrA7uwUip1U8Qy;aownElH-_C6ZRqTf# zIY`>ayH-6;IeIMQAj%*l&IbmnlDR8w4?OYo_LxUFd}%$3j6*v6xTc(asOKO^5tYA3 zWK^W>9%M`Kbq*pL)rk=F&@!!%7-BG+236S_H1XhZDx=Bo=vwxmw$}Bq*3!;n6w_Vj zo2ES%%l4BWfp&N3{dJY=wRgj1FlhJ;)%_wEU<*Xx&Q-6Q^TXg>&(qYq zy>G_J?x5Vxr+_;OoUik>?(508>S&kuO>u?yJ|=@|tHES8@=3I8cL#Jkw!2lPfzFpZKc!EcLQN+SJd&hlkOPD=jl8e>bp$MQybz|7 z*yQV4b_#YHBqJPldgjB^r{nXAvvb?$o$aSEHyG^`F5h-a!qDg^UoM1w%0c+k9kA3B z%s$C|jqWwTnK9%E(mu%`*nJ=B!ZJO+)R*Ul$~Bd%D?3kDuBu$QboaQgIb2x$?{;4c zSXOMky~64&Am-=TlmyW2m26|ekDY_#>fu(b2NrJbKFgoM-iZ~AsVZTM!N zXn&6nX6r7jTwi%%!JG@_h)E%9>ur(_*mtJc->_*h(vFj$8wZ~n3mB)fkBaLt2>jzQ`sXFrvo)c|WRx#N zxoojp?X1z|3&FD#2h6;s zAVVv!RLH%3Ue;c-1M4AP)*kaKrabc)Hh#`JQm7L9{3Fb~1KX9nI6v{?T+8d@FHW}* z-eRjDh@biHNYi<1kNt>E=QBaW>uys&Zt(Jwxem}gP8A$)<}yPm*9O5^G1_JFTk8pK zH1j$`1J#{TAt?*L-^^Qj`%F4(@7}5(Pu9|&8j~JN9m!kuzHjCyn&qaL|Ledy$4;$i zk=d`SO;~Tj%_jVs32!pt_f7b)37<3Jt0sKcgrAr&wZ6p*7R+%?T(z-15^HzO@J#iT zx~EQUm+aI@8sVB+QaYowq_jl!AfE1-?V0K>Ez!iKrITEOQIk=Hwyy4*PfQPAXSqg- z3Xh+qPp096#!z%`S`GT}CpaVNi_wNNOEp$KnF&u?kf&7E@6xhaM6AN{wD=&c#9x&?lBr9^PIm4 znD@CLE3QE-OwX*mS-|}J1uS?;z{39#;B_E;re`jiBw+D80lr!Q`)auOpppUp)l*gW zFq;E^j{`ICXK+Ph=!(qG5GS*qxew7g^HsDs>)BV4bmY8|Mym9|6?ak8;I7*Q?0!JN zwa*K?tH<0S&Vv0K1R-xF~2eFARzt$=TSD&W?UXHv>- ziv;Wo2>A9E0sC(e@SO(*eD_xZ?)X^1T|@ESP5R&;%n@+U1p}&BPr#9Z zh499~4#O>Qpy3mkX*2?69Y?S+oX2?ltZFkR)}4}H_}_n`+J`5yw~%+E(Do~E0SAbJFhc4i&53Zq0pfA`Cp!W{s{}uB}_0WNs z0@93OUx6eDQ7W$#Vzf5R)1gTI%^)!HGf-s9Uq|BnwNTZO|2R0D`O6{LHSBv*DY-YG z2F?AAdUCg*5|#gb&>HzOp{FhXAK*?KR?X_9zBi$a=6LLSa&#iE@_&kU8~G<-4%@Ix zDTB0UJd2R^8LV00q=|BCZN@*57+!$+GIyQr`-Mm!N4s;^+t?i=NR_+Bb_*mLuOj^> z{zg6wDm7{_i`LpEQ?b8T=#lhgY-=^K@GgU$VVpT1wdWo-*c#)^%h251a|{kSWAqom$X`cr!PjXIY$x{ZQw);TpM(AuhUe_&j$nc2Bx z@T!u^y;q}bqmRM^av#vSv@v*7Dfc0rag5M))xxdgTV+>yEQn^QT&Zg3btT+reNgq=CxPX;19}ZdnmgGYJ5YU)gM3V4$ zfHQs#kv^DrEEi@B!-Wswwx5IWjJ-B&74}_be+U}oEhuV*Lk(TI3HM7unDY`iGH-|X zW_3g-J{t`yW-#r=0qI*DOJLfLkzlrR)45g}~)=78#olBi`#|K>Dq&q(30w>+^G1oomj!(GE8C)0M ztQ>znjFypc0&35`79(D6%DxZv3@c7QV=^OZ`Wfy&0AyW|rnq)XQTTikL_!Dz!1Kz+On&cSp3W1TqXX8n>^o=lZ=I5~e@QG~r zS!wCvNDO4@m!KmvJ7CA*J89}n2X4c6F$o#lVV%r7FkpvYC51zfAKt~}*^bE$YL6NQ zpoSa@o$O$9bBJaqstqG%@G-}I7Z4+655Zlz{~O*oVh+;|_asOgQNgs+{dM^2h($~n zxJRKmBNj95a(@r^5k96Ty6+@!71Jf|apbLLdX~EyEgi9h=?eF1%2~>^&wU{jAF+(; z)VKpoFK7BI?pD}hL=Dp`+`FLEh!srNy02utE16#DK7oiaVl~sN+~?vx;zFiZyZtcX zh>MtB<8Gpy0Ml#TJ18f}^!e_~DJR7A1@8Z$oCc=Xxyx}M5n+10dmZJpFnyu&T!cX~ z;;U4e&x6^tWj5CtYRdcQoe|qF2X?Z9Pmbu5UrG0-H=$&bGwmbTVUi>5p9E=XXG2it zWl(G6n1{eq!k&5-iP8^|7@#tzAw6ms@!sz^5{IK$SB~DnMV7 zh8v%6MHQu{T}-;_dSJ5UMs75cWSKL-J$fP)&zz01F?!V%z)p5tjr;T)$RWftCOeps zr?f`VI_SFjny?+&vZPv5IRn<#xo=Y3?DYZLD%a2Z#GE_@PcaRc0IIZe&H7AEHr( zB`Y8%>u*TDUi9&=p^3W|tVN$lv)rEoQS=$T!QuWBXo@~(+UY(U6&C%A=>qpnOnzIHP)9dnVPcS!rnz0 zl381J5*imdj2q!<8_F(4BZ@MOTajrjD@NOk1{qYiwd_)$iky;(mCa;ki18LmI?8?x zJ&J}I-$7<9JEvUk|}Q3h9{SC^Gjz&N8DWP8e@)WBoV zrni)hLQpB1BANYVm$IZpGIy6<&P=If4wTVNil!R30z6u_2V#n*i*5(YFukavGUH*? z@Qlj*7zBkC?24(5;@aP%d1Fy9Gp%^F18~-z;4EItUY_*`%vHSpPS7j2jp>!TrzV28 z_`>6`Uz*B%3j&HSdJCDU&T+#cu>Dsc#=RIlGVTnTL%DB9CU> z>yZ&G_lg9Y2Tw$$g%K(?=X;P^ILH2Hq_cU0AZ{*sDiI6{|H2x$pQMY*v(ZC^bM3@( zd&$Jkr?h#3It^yHnI%zEhtBdfWPR2~H{b?WHhn0YIepXo*OF+M z@N@es!EY)!l|J$pQJec>T0urt9fHa^rVERt0j2SBrqFW9RNcQwm22wme4dE|b=C%S~FZ=7ivZh0E>SebY_#9Eae-2WVUF#hFMR zEEYaUBzNW#EmLz&!`%x1VdGAnu5`{JVwM`*w9`$bomKf-_(Nfh44&aw>m`bG7tok$ z%AeV|r)f^lWctI)y4tCZ@f#aa#a5u*nP}DcAPdzwZJ}m0 zzK&^(t1u|WhsZkBIsW2j(JF2nYWhtysY&0&G{)6)pcvo0OVe+@0p(n$YWgi)shad1 zOoRSLV8(BK5Hy+JhrK71^N}PoADuH{NjjP`&ki3O|BfvK`;C(wgK$5Wnz@k3j^9u+ z9*Bx^H>@#!fV7r7n%OtfMxHM)e8%tDhYGpBX?9R16}^G7xZ7zW2NQV{o5HEcY>K{Z83(B$#M>@+Di zRI^#L+*J8z?2(Jax4FqG3{oN9)&OzW|7>uV$tQ39n*lFl$OqAb@@%~z<|i% z_G~KgoD7zKZsVS9>L8Uy&HWsaYW!w#!#STZ-C=M`H(O?4&kox54%+s|M2Z$np-bq1 zo)>W&{|MW~o!>;c9>E?T+;jY6_o0|O!l}jOx55v`za;(1tzs#MX~@*1+fOVj%62m) zV*>3*I)_FmKgkXaN$dH9rAb+$%A0BXQFgi~pSqGBqdb$@KRAhdYMQ* zmZhrd`HUU>>QyM_<65ucpV1EYaC3%_afxE(Ig@hl`vyw5ft^$`pUb$3%Xz1#b6;Eg z9z9Ao)sv6*O}v>1?sscuS-Y0!!$=eN=|u*Mv>QGHH72eTEVsn9J%qvYJ2Ko#3v!n{ zQKD;_zX0u<_y+GJ=MK8AP2@U1gE1#gGzeJCo%JMT=ATP7KjNLG+;C53-bbYt7z8Zl z)_W53f>^VfHQ`F`#Jd-u<0f1sRl5HKUz~6?(`oKvXg#5mX@`3g(_d$Lko$eyC&)U} z>0S%b6RsgX-_0Y^3A>pta9_mqwM>t4{}$dn;X0;W?%NP}CR|U?o#_4zBJ_kCs9cGf z@(?;~!q0eI;CTamGvR4^KaU2od3GQ-<+%censAti=UBoUh6J1Dd7JzPS@cI1@rEMi z%YV-zy%_u#%XmYX9ZRPi@|M3v0*Cb9XdttB13@tfD8cgpTmLs!$CC(M?s21ACVWUF z&m~OcZVdbhzhHlFAyNhrbK3M$^Z19rIA|vK2+{`4dI;U8a%hlAhHV1coWq^Hc^@HA zjR_eH2bq81D(qq|vC40T_~L-U-5Q=*nEsbf|2b|W_HAN$gZ^BFmycvwhMm!j=NdXv zu`e`Lc?65H;(rJ)4?MCtjLo9kS(GiqoQEJf7>MlhHdIi&L_!D;Mufps#zw9cQpCd& zUBo!D5P<`&D*i7i;|WTSvY}M;JyC?mDq4rRD`30g_XS&i3jR{uA&cN&k%FEh<0zY1 zG?-^Qjk*7S#7PPbHzK|lG{78{1FNF1r*NYW+5Ts>`Skp{@B*B$Jz#}4Uc(d$D znrWz=ea&;DY$mj=$_*+~Cv1OXk@$i{aAwgwKKzxRU?1EsR6J@*r79oG$}f>}oS2rOP$zHpZ);ND+^-l8apIx;8O7kGK-^itaTJ z|GjtdZR`pjeQC|uKIJjkUEiZy^E51>j`CE~UI$si1G40jA#B49l*Ti&WNGy*`J6q% zW3(im^54@1*T^KvqqS7y$oMWFL!vR#3?94*zw+$HXe|CVtK%_TqB?WV`54V8mWLo7 z&n4{&#*Nw_7qQ)D!-jx9g+e4N0xI~sPY0jlvl9ESW6!n5t{2WmRE_=W2HQ< zv@Q>EL@k%{%D&1Eu~93eJP7Xr7Il==ldoeUx{q z$m3FNKv`KqQ8yq+{K8eCHGkXD!LzC8i0ivMhI6~}YiM3LFIMQqr62A6SiLd!a`$*Rk} z4jxK+9X!IFY~D472bGzp!9B^v5u8KsnC#&0e`Xbgoi&|^%oS+#SwHYObxWej36&HW5)VPuoSLD_&=H=`PdG5BqAmB34kTo$9? zzfj;b@{D4LSdHUT5#}BMV;RGUq=aWFVNW(Cl$}Mw&B~ai3I7MJFlI}&D$5Dg3XJjw zkhpI}rx@pGqJN-{T%O^Xc$W3+(kUNid7Hvgx@tIg4 z8wKOBQ9-q>H;*dW0$j$v-+;&`)+nGD+urq6w1=5lTYVi`X^bGRZEvGm+|I1)YWBc5 zYSl1JH-)O1#5^uQJ6QLUb`f$j6z*W-IB%1C?YYXPIl0`O9xTa$&Kjp`%JkH z$K~Egx!{?sdDd1%+k(hxX)ARD%v_B$z|1VIJ|hiMJ@E!)(7N*r(Mz;fD62xMm=Uk& zPpk;NG~cv_Px{Hst*w3p!@^idRxt+;*Nkeue^5Lg?+}>MHpQh8>yu8bHsw`spbsr& zfo?k8V%art5o6Vz7zycvv_{k7GFm}e6+kh&+qQRY)y8;u~O-ngCZll?#Y-u>HaE;chuRx9Hn%D3;mV|%qI^)Myb_f}+R ze||)_&$s-*5N(80W<&IVc~*Bs&60LyJf{WSy}kNJb|`w7Bh$Y3!1m=QP1Z+D)+K1~ z3!3O?<(*b3)kUg?E5Qdt3jlU*GOR7>!V0B zy>v+^o~~Jf;br1iF2V3J(`%P76q=d!%SYx{h~%f`t`uX~n>rqCz(eX*xZD>e$vl(9 z*f;(x^rMe0eOD{d!oQt49jKgTlEX5%-y@yKZbt{wDaGJ@mk|U z?9IhmcZYRtUt0^*4QV)h(%1GiJbC&ST%IHy=ih_eWL>=df;8F=5-Tn!LF(sFZ2OuZ zQg@2T%hvIIsqs+o^mfd2#<-lkEPKw#oLpnb04El2w%LZ=F(<1$%Yf4M*~*^73?$A` zOcVf{?uaMxngp=v#0~&086nvrw1UOEL-w4kEG;8*m?^Fb^jUd^Rl=$Ud5m+1>&hZI zbB7a^ovuijGhV=8ArRFfIaPU@1g~V7T-O#>-BNF1FklrpFnUR}_wVoes()r%5}kDUUYXuCq47>#O+rklp6 zO|+)PK*bHJQR6HsS{Qx;Zx9Dy3-H#U&RF~t6J3baLb1xqng?IPTF*>k(l~oCuy9TS zD&$Vcm<7BiZVQxZ15c6OlS;J?C5BNY7AzeL3r+#o)I3AGR3wLbO-l&5%0L$oH+`r< zFoVObEMX$nIr9vYn*_5G`rv%R@=qLu#bu^zf#nH=rRm(brsy?V>l_FZdsgMKqIrov z#qq#UvlSJX>{X>m6Bo6l&5u`*m2l++u&_h7mD(=koa%L&wp=t*2FBu^j2y@n1vkwX zGx*ZuU1kGs6|$y+%vL8lo7p9nJ5=Q{yEIvD52?#~m)xxDTb_lGGGqY$U1%~%Ri0)y ziE0w{Ak<5zqPi6c4vXGwM6Cx-IDL2z6;^uCup}G~5ZM@d=5!f_tMOebX~r5RA~~ZF zXxExa=y$%E#NfWbOrpounMn*GbqnIDP31AJ8=vK5<8E-?;j(2)d$eszI1+4XuM17V zXUL|^P(4uiu${kby7`s6hDf`nnX(Zd0qaR9yi@8z8`~TDD(H_P)Di1R-mAi1oSGir z@S4&P3{L4qKf`JcUPB9C9NmO3mifcYtxcikP$U+JgcgtvqAifM1 zz!%h*jD}(tH@E6!xFHf~(#cp|psm45hFh!@6fu)+;fOAeg`2gcv(FB;MC!v0o<`VT ziE)rbKLnZ@TH3;~#^(Ahb-V*JYpc{o2~GG^ zT$~KDDIpTtLeSb4steVJBcVEfOKVgUp$L_->9LkJpx`W#_U2F7Qc-l@H9}PDkYo^71CXE=-Ovmb=0n!Mj_y;7grcTe@*dA_*xx*1zh@d1)E1&|H z)=G*!G}gb^AGa#Ch}D5k7t!!Kg`P!k=rkJFj23NaX``*t5nF<6kuJn?#b!Nd+6#== zUfX;7V@pb2e{HYhUS&(OXT)%~W$fbJ@q>$(lsJ|+ra0bl{7CNiVk!mc?Mq62^qS+| z+xI)}T~hMcy|3Ln@7;!be*_kTG7MW;?o!m7oO|4HFGS$aHY4AWf9}rLN*{A9+5fJs zFpqzZ$KP?}FDZ45bzJXwfs7g7&ahSG+veuk%JXa$d5)3(bMJM0*nWPAqfm-t8M}5l z9&_xql@3PUc4p+Ac@CG|bCJX@(b2!#!EVUKqIbN`L{M4Sc*3sa2;fi;`eSxhg4`wN}&B$~7 zW|||=-u+|@K zY}wMNzHk@~EeUO{nYk<+@r44d;V?C5Y-`y<($#^cc6@*l+PB3vw%3Cf z(Gp)D>`;PowMQ^SF!)?-85$i4LX}_u6^3J5sXLXaXLDLMhuZ3!AQb}yf1!XvkZcPC zW2jfYdf4k*jMFi!>%90pV)KgHQha=|zA4ZURpF@ia|PQq#2WE&NLXi4b4-__ZT0m~ z90MiRLQC}=_1)N6{%!qCYw3;nn-clE;sVOZ@%Cg>A3o2|2M564GaI`K8 z={kP;5jHll)v=bQCe>`(uYRk-(1fXK@jc5R(_!A4s8f)HV2HLx;@u9T1Yl`4%QOE$1=}Pj(^3%$bw){Yyd5bHOmRe!jk5W;smNdHyYk>z4P?@BCW= zQSF9|J1xx{#Zh71HqI<`QhZyzD}IG9ee-4FDhtBY0Kz4Z9cQW)_ z+hcmVW34j!;Xxq|kM=g$Cx~&mwRt1_;>%VMj#m+D!M8y9*;3AtqFvCxIUv)dVhKhR z13<(djQTM_1~El)z<;@xG{vhCzw^WK{INiTHfej4DlJ7r@p)H9BiILx+ZsU){wf4&(;^)bT0T)mhzF%6UXk4YXmKN!g-d|Xq8oI>0Vo9)eDnHX& zI*oxX7BYu224Iw9R$;r1qZ~m*FOlS1u==~JwFt)@A%u)tKmSz$`d*K?*0wO$G+R0P zFU2Qmse8S4)(d7?OEGKkspgGsY*<@p3t|`7C`rKtwR)RdAqkZu9@Lqz3DH45^nz)d)no0aJlQ{^SAESww723v8K%p z17g-wt)aHImNvzqEm2eVxr9M+HqMgrVPJNI^n0N0;-%<&m?_q>QSqC^vBsA6XdqID zU>0hH(ipM`W$}R5YQ~^g>C{>A$&O9l*wWGzXliW?sLl0exJ8%8(C}tV;t^uuIguEr zOfyV@t0`1Z%d`eC{iFM0E$!$bF?h;HjHi1yt0=$hi;fh{!OUeqy*bf|$r+=XF|Vq6 zi8X!qTxn_O5>9&(Ea*iXA;N%=fOZ7x%y7&3hBGd)@+IO3pJI?{3pX^z%n8JNw)nRb zNM&Mis>}(B?yfrwy-`_rv2NA{r6q}pGqDI!^>9W^TQXD-bgY5a*E3I_4qK*|2V6e% zW0$GPQB;N(dMXr??<@B;1g2qTVz0#7B$|bzRS|P=Bi>=|;e@gobD#7p0wk;bQd38> zcb4TNUdX`MZiGWNg%ICWk1&S9ewH(OF@|2A$Lb@&R#|&RH-%fbP>)&Sih;Ja8ZHme zrTk}X!KM(FVQrXWqY~-*YIB*6o8A>cgx18E;&?|mM8~OK%Lf(3TB(j|a4A^d$_1HB zq<%&X86Q!EKa|V(YiMg}Z{-taL!6QmIgN?tVAS>BXs&$YW0DKdc^G@qcns2$BUZUd zVF9g=ZpCNEn-xp(*yduN$;8Pyu4j&mX&pYSCu&54y0EM-H-;mDwykhW1QTohF8Y{@ zcvxpkT>!nn=9f)JvuO}?i!2F{-5ia_2Lu}~Yjjl%J)CiAV$QN+DDc8$;!_9%5!!w$ zrBf!Cl6{VV=?o3lI?FEsG7;BgO(@Z>Z)U6GYl6+}in?fvUppl-SmjWCy~e~lzl=ci zh89_1@dM?IC|u>Kq|hVlGp=SgTMftfv*MDt7UKSELsOaqLLX?Ff(MMo_Kj02t(~pt6l*G?#xZ$3(~gTkt8E~W zYuZ$F#wAfaHscwG5lEi0wS5p5w*+NCg9TFtp0FGFTvJ*iJ^-=cr8(-tZ3;Eu0mxeO zp=>jwwK-?18RjE>t-qnAMP_odTTOQ9RrI>(oyltP>4s$Es20rdn*=wMRtr-fPp+(xgbj zRjRU9Nebf`K?B1i!j*EpJOsjD(ANmdUs@;q_#rxROyH*&+Oe;~aAf*o@-_=&tb}te z9Wmu1Ov80U*ahOe2I~vptXw+1=ko!lW;_;H6DE3%BZ)Cy?;6M^1WXBxl$cQ^sdFTV z$wtUj)x1eRq@Zi?@1{AW@>xvcQ_r>L0zmr6*ziG%FbBq$Jm!Sa<58CzCY(l`;Gh76)&d)?6lx8%wJHxDtwNs4`BiQ{1nV5O2|V20t#gO#l!v*-05tQ|ZH+*l zhUk4M!M0Zv0k=oSkFvHlFAjnX(gWBcM%8!(%KE-oPx=9>ukUi%v5#+k&#Nc>K(#-kA{ixVyUL7zKPuCkQ%9krhLL8`=2 zk&KeGonKoU*cU!WS>InvX0qeWoTEegqIcqVruxF?s#}Kjg&z|Co?B1(dCK~ZTTgsG zzSpuL86{~uzQ)$qcgO5%n6iHFC7H?2udliKl2f2M`ot%Guc)US{!@qEmtFDo*xr{t z{#Cl3Wp>3E$a`OQg?Fm^xaKcaMp0 zO~F^1_|)(Etr7Xd)seytNXZeXzmoMKm@u@GW+MqDy??{o)PYAJp z`SVA-LUPCZN+v$_Rn=K0er9HcP5WJa50z3P`-)725 zeHHVEz_Z@h3pXT5!S}EFk@HJaPU`ER-6nnN@7tB&4FTFG^;Kjq@a*5z_AWK)Q{Q*| zis1X0_wlqBjkVX;d$^fWy$h!9CW5G-6tw=0y={TJGx4(SY`?SiG&K=p5XEprVU{96wum71i{Ma9V z;;+|F0j3rwemyXyq>nwOKAsr)6N^2y`2YO%#y*b8X!ZZa?Xv9q$r???K3ba)>p=6*jIEMJ3eIHPWlrPS8nj@FlYi6CVQ6|eRLaX8y9KFY0t zz7IjT&)9SK+V976Tf*&9pPu25Nxu`B=v-`s!I|_AV5T-J<#0f@^Gx@*em*mmrT^W} z|Lsp}_Nt+ey^)YSxawU6j_n>(!T&15CjaUSmLr#iKa1abem-I%4wwzb8**YNi@(5>vKkOekvPBgoV~+T)cS6>NiH(1 zG~q?~<2SRd`mN{jiL4Np)qYEVi_U_ZK*MivTY2lby~gCP5h?ikDj;br{Y|vG6bY(o z@$b*5kfQx2zfW>_pWcKPzt#R-z>|NzS>A2(cboh!(|+XVGhizJwZM_YB#-YGI84IS zCtKE)e03s|%x~>0l$iWSl8KRant2P}n8I&8U*Lzp<@z<1PP!~U3w0|J$@N?N6t9^7 zhQbtMk&CV386@`OkNlSXt^JInCckADkjRzV{=0!q=C}4etl!zb$KDnI}AR5HJ{ zKXS`3&GDwCm?^;OKTF<0B=9!9i~-`T=fzXzRzj-1Qu$v35B{Z4oZos5b(mWYsr0G& z*TGBuIR<%I`!dci$^RC3Xk&}t+P^6<`HxaKE~_7``mJ`oi?ZbUt$m(T=GKTsFG6s$ z@)kUi!XMuca%qkZ4dQo;&w?MJB)NX;`MblVSu8y*0T!Q?{}c)0toHABZIGg?T>|32 zW3O{cnP@AkxY5JE4rr)aiQ$ESThuu0jv<&8ThmO$BO?fwtPo(==+|ihHL(f G{r(S(;oz(Q literal 0 HcmV?d00001 diff --git a/Shortest_Path/dijsktra/dijsktra_implementation.cpp b/Shortest_Path/dijsktra/dijsktra_implementation.cpp new file mode 100644 index 000000000..d2d0025f5 --- /dev/null +++ b/Shortest_Path/dijsktra/dijsktra_implementation.cpp @@ -0,0 +1,230 @@ +#include +using namespace std; +#define lli long long int +#define infinite 0xffff +#define Min(a,b) ((a)<(b)?(a):(b)) +#define Max(a,b) ((a)>(b)?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s , i--) +struct adjListNode +{ + int dest; + int wt; + struct adjListNode *next; +}; +struct adjList +{ + struct adjListNode *head; +}; +struct Graph +{ + int V ; + struct adjList *array; +}; +struct adjListNode * newAdjNode(int dest, int wt) +{ + struct adjListNode *newNode = (struct adjListNode* )malloc(sizeof(struct adjListNode)); + newNode->dest = dest; + newNode->wt = wt; + newNode->next = NULL ; + return newNode; +} +struct Graph* createGraph(int V,int E) +{ + int i ; + struct Graph* G = (struct Graph *)malloc(sizeof(struct Graph)); + G->V = V ; + G->array = (struct adjList*)malloc(E*sizeof(struct adjList)); + fr(i,0,V) + { + G->array[i].head = NULL ; + } + return G ; +} +void addEdge(struct Graph *G,int src, int dest, int wt) +{ + struct adjListNode*temp=newAdjNode(dest,wt); + temp->next=G->array[src].head; + G->array[src].head=temp; + + temp=newAdjNode(src,wt); + temp->next=G->array[dest].head; + G->array[dest].head=temp; +} +struct MinHeapNode +{ + int v; + int dist; +}; +struct MinHeap +{ + int size; + int capacity; + int *pos; + struct MinHeapNode **array; +}; +struct MinHeapNode* newMinHeapNode(int v, int dist) +{ + struct MinHeapNode* minHeapNode = + (struct MinHeapNode*) malloc(sizeof(struct MinHeapNode)); + minHeapNode->v = v; + minHeapNode->dist = dist; + return minHeapNode; +} +struct MinHeap* createMinHeap(int capacity) +{ + struct MinHeap* minHeap = + (struct MinHeap*) malloc(sizeof(struct MinHeap)); + minHeap->pos = (int *)malloc(capacity * sizeof(int)); + minHeap->size = 0; + minHeap->capacity = capacity; + minHeap->array = + (struct MinHeapNode**) malloc(capacity * sizeof(struct MinHeapNode*)); + return minHeap; +} +void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) +{ + struct MinHeapNode* t = *a; + *a = *b; + *b = t; +} +void minHeapify(struct MinHeap* minHeap, int idx) +{ + int smallest, left, right; + smallest = idx; + left = 2 * idx + 1; + right = 2 * idx + 2; + + if (left < minHeap->size && + minHeap->array[left]->dist < minHeap->array[smallest]->dist ) + smallest = left; + + if (right < minHeap->size && + minHeap->array[right]->dist < minHeap->array[smallest]->dist ) + smallest = right; + + if (smallest != idx) + { + MinHeapNode *smallestNode = minHeap->array[smallest]; + MinHeapNode *idxNode = minHeap->array[idx]; + + minHeap->pos[smallestNode->v] = idx; + minHeap->pos[idxNode->v] = smallest; + + swapMinHeapNode(&minHeap->array[smallest], &minHeap->array[idx]); + + minHeapify(minHeap, smallest); + } +} + +int isEmpty(struct MinHeap* minHeap) +{ + return minHeap->size == 0; +} + +struct MinHeapNode* extractMin(struct MinHeap* minHeap) +{ + if (isEmpty(minHeap)) + return NULL; + + struct MinHeapNode* root = minHeap->array[0]; + + struct MinHeapNode* lastNode = minHeap->array[minHeap->size - 1]; + minHeap->array[0] = lastNode; + + minHeap->pos[root->v] = minHeap->size-1; + minHeap->pos[lastNode->v] = 0; + + --minHeap->size; + minHeapify(minHeap, 0); + + return root; +} + +void decreaseKey(struct MinHeap* minHeap, int v, int dist) +{ + int i = minHeap->pos[v]; + + minHeap->array[i]->dist = dist; + + while (i && minHeap->array[i]->dist < minHeap->array[(i - 1) / 2]->dist) + { + minHeap->pos[minHeap->array[i]->v] = (i-1)/2; + minHeap->pos[minHeap->array[(i-1)/2]->v] = i; + swapMinHeapNode(&minHeap->array[i], &minHeap->array[(i - 1) / 2]); + i = (i - 1) / 2; + } +} + +bool isInMinHeap(struct MinHeap *minHeap, int v) +{ + if (minHeap->pos[v] < minHeap->size) + return true; + return false; +} +void printarr(int dist[], int v , int src) +{ + int i ; + fr(i,0,v) + { + if(i==src) + continue; + if(dist[i] == infinite) + dist[i] = -1 ; + cout<V; + int dist[V]; + struct MinHeap * minHeap = createMinHeap(V); + fr(i,0,V) + { + dist[i] = infinite ; + minHeap->array[i] = newMinHeapNode(i,dist[i]); + minHeap->pos[i] = i ; + } + minHeap->array[src] = newMinHeapNode(src,dist[src]) ; + minHeap->pos[src] = src ; + dist[src] = 0 ; + decreaseKey(minHeap,src,dist[src]); + minHeap->size = V ; + while(!isEmpty(minHeap)) + { + struct MinHeapNode* minHeapNode = extractMin(minHeap); + int u = minHeapNode->v; + struct adjListNode* pCrawl = G->array[u].head; + while (pCrawl != NULL) + { + int v = pCrawl->dest; + if (isInMinHeap(minHeap, v) && dist[u] != INT_MAX && pCrawl->wt + dist[u] < dist[v]) + { + dist[v] = dist[u] + pCrawl->wt; + decreaseKey(minHeap, v, dist[v]); + } + pCrawl = pCrawl->next; + } + } + printarr(dist,V,src); +} +int main(void) +{ + int test,v,e,a,b,wt; + cin>>test; + while(test--) + { + cin>>v>>e; + struct Graph* G = createGraph(v,e); + while(e--) + { + cin>>a>>b>>wt; + addEdge(G,a-1,b-1,wt); + } + cin>>a; + dijsktra(G,a-1); + } + return 0; +} \ No newline at end of file diff --git a/binaryIndexedTree/SPOJ_ctrick.cpp b/binaryIndexedTree/SPOJ_ctrick.cpp new file mode 100644 index 000000000..54660c92a --- /dev/null +++ b/binaryIndexedTree/SPOJ_ctrick.cpp @@ -0,0 +1,116 @@ +#include +#include +#include +#include +#include +using namespace std; +#define lli long long int +#define Min(a,b) (a 0){ + sum += T[index] ; + index = index - (index&(-1*index)); + } + return sum ; +} +void update(lli T[] , lli n , lli index , lli value ){ + index++; + while(index <= n){ + T[index] += value ; + index = index + (index&(-1*index)); + } +} +lli * binary_indexed_tree(lli n){ + lli i ; + lli* T =(lli *) malloc(sizeof(lli)*200002) ; + for(i = 1 ; i <= n+1 ; i++) + { + T[i] = 0 ; + } + for(i = 0 ; i < n ; i++) + { + update(T,n,i,1) ; + } + return T ; +} +void renew(lli* T,lli n) +{ + lli i ; + for(i = 1 ; i <= n+1 ; i++) + { + T[i] = 0 ; + } + for(i = 0 ; i < n ; i++) + { + update(T,n,i,1) ; + } +} + +lli modified_binary_search(lli * T, lli val, lli start , lli end) +{ + lli mid = (start+end)/2 ; + lli mid_sum = sum(T,mid) ; + if((mid_sum == val)&&(hash_array_mod[mid+1] == 0)) + return mid; + else if( (mid_sum > val) || ((mid_sum == val)&&(hash_array_mod[mid+1] != 0)) ) + { + return modified_binary_search(T,val,start,mid-1); + } + else + { + return modified_binary_search(T,val,mid+1,end); + } +} +int main() { + lli test,n,i,j,ans,current_pos,next_pos_sum,next_pos,count,free_space_total; + lli a[200002]; + cin>>test; + lli* T = binary_indexed_tree(n); + while(test--) + { + cin>>n; + //cin>>query; + if(n == 1) + { + cout<<"1"< Date: Wed, 2 Dec 2015 01:33:02 +0530 Subject: [PATCH 06/32] Adding Minimum Spanning Tree Algos --- Minimum_Spanning_Tree/KruskalMST.cpp | 107 +++++++++++++ Minimum_Spanning_Tree/Prims.cpp | 225 +++++++++++++++++++++++++++ Minimum_Spanning_Tree/a.out | Bin 0 -> 53424 bytes 3 files changed, 332 insertions(+) create mode 100644 Minimum_Spanning_Tree/KruskalMST.cpp create mode 100644 Minimum_Spanning_Tree/Prims.cpp create mode 100755 Minimum_Spanning_Tree/a.out diff --git a/Minimum_Spanning_Tree/KruskalMST.cpp b/Minimum_Spanning_Tree/KruskalMST.cpp new file mode 100644 index 000000000..222e852dd --- /dev/null +++ b/Minimum_Spanning_Tree/KruskalMST.cpp @@ -0,0 +1,107 @@ +#include +using namespace std; +#define lli long long int +#define infinite numeric_limits::max() +#define Min(a,b) ((a)<(b)?(a):(b)) +#define Max(a,b) ((a)>(b)?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s , i--) +struct edge +{ + lli wt; + int src; + int dest; +}; +struct Graph +{ + int V; + int E; + struct edge* array; +}; +struct sub +{ + int parent; + int rank; +}; +bool comp(struct edge &a, struct edge &b) +{ + return ((a.wt)<(b.wt)); +} +int find(struct sub subset[], int i) +{ + if(subset[i].parent != i) + { + subset[i].parent = find(subset,subset[i].parent); + } + return subset[i].parent ; +} +void Union(struct sub subset[] , int x, int y) +{ + int xfather = find(subset,x); + int yfather = find(subset,y); + if(subset[xfather].rankV = V ; + G->E = E ; + G->array = (struct edge*)malloc(E*sizeof(struct edge)); + return G ; +} +void KruskalMST(struct Graph *G) +{ + int i ; + int V = G->V ; + int E = G->E ; + lli sum = 0 ; + struct sub subset[G->V]; + fr(i,0,V) + { + subset[i].parent = i ; + subset[i].rank = 0 ; + } + sort(G->array, (G->array)+G->E,comp); + fr(i,0,E) + { + int x = find(subset,G->array[i].src); + int y = find(subset,G->array[i].dest); + if(x==y) + continue; + else + { + Union(subset,G->array[i].src,G->array[i].dest); + sum+=G->array[i].wt; + } + } + cout<>v>>e; + struct Graph* G = createGraph(v,e); + int ed = 0; + int temp = e ; + while(e--) + { + cin>>a>>b>>wt; + G->array[ed].src=a-1; + G->array[ed].dest=b-1; + G->array[ed].wt=wt; + ed++; + } + cin>>a; + KruskalMST(G); + return 0; +} \ No newline at end of file diff --git a/Minimum_Spanning_Tree/Prims.cpp b/Minimum_Spanning_Tree/Prims.cpp new file mode 100644 index 000000000..242040193 --- /dev/null +++ b/Minimum_Spanning_Tree/Prims.cpp @@ -0,0 +1,225 @@ +#include +using namespace std; +#define lli long long int +#define infinite numeric_limits::max() +#define Min(a,b) ((a)<(b)?(a):(b)) +#define Max(a,b) ((a)>(b)?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s , i--) +struct adjListNode +{ + int dest; + int wt; + struct adjListNode *next; +}; +struct adjList +{ + struct adjListNode *head; +}; +struct Graph +{ + int V ; + struct adjList *array; +}; +struct adjListNode * newAdjNode(int dest, int wt) +{ + struct adjListNode *newNode = (struct adjListNode* )malloc(sizeof(struct adjListNode)); + newNode->dest = dest; + newNode->wt = wt; + newNode->next = NULL ; + return newNode; +} +struct Graph* createGraph(int V,int E) +{ + int i ; + struct Graph* G = (struct Graph *)malloc(sizeof(struct Graph)); + G->V = V ; + G->array = (struct adjList*)malloc(E*sizeof(struct adjList)); + fr(i,0,V) + { + G->array[i].head = NULL ; + } + return G ; +} +void addEdge(struct Graph *G,int src, int dest, int wt) +{ + struct adjListNode*temp=newAdjNode(dest,wt); + temp->next=G->array[src].head; + G->array[src].head=temp; + + temp=newAdjNode(src,wt); + temp->next=G->array[dest].head; + G->array[dest].head=temp; +} +struct MinHeapNode +{ + int v; + lli dist; +}; +struct MinHeap +{ + int size; + int capacity; + int *pos; + struct MinHeapNode **array; +}; +struct MinHeapNode* newMinHeapNode(int v, lli dist) +{ + struct MinHeapNode* minHeapNode = + (struct MinHeapNode*) malloc(sizeof(struct MinHeapNode)); + minHeapNode->v = v; + minHeapNode->dist = dist; + return minHeapNode; +} +struct MinHeap* createMinHeap(int capacity) +{ + struct MinHeap* minHeap = + (struct MinHeap*) malloc(sizeof(struct MinHeap)); + minHeap->pos = (int *)malloc(capacity * sizeof(int)); + minHeap->size = 0; + minHeap->capacity = capacity; + minHeap->array = + (struct MinHeapNode**) malloc(capacity * sizeof(struct MinHeapNode*)); + return minHeap; +} +void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) +{ + struct MinHeapNode* t = *a; + *a = *b; + *b = t; +} +void minHeapify(struct MinHeap* minHeap, int idx) +{ + int smallest, left, right; + smallest = idx; + left = 2 * idx + 1; + right = 2 * idx + 2; + + if (left < minHeap->size && + minHeap->array[left]->dist < minHeap->array[smallest]->dist ) + smallest = left; + + if (right < minHeap->size && + minHeap->array[right]->dist < minHeap->array[smallest]->dist ) + smallest = right; + + if (smallest != idx) + { + MinHeapNode *smallestNode = minHeap->array[smallest]; + MinHeapNode *idxNode = minHeap->array[idx]; + + minHeap->pos[smallestNode->v] = idx; + minHeap->pos[idxNode->v] = smallest; + + swapMinHeapNode(&minHeap->array[smallest], &minHeap->array[idx]); + + minHeapify(minHeap, smallest); + } +} + +int isEmpty(struct MinHeap* minHeap) +{ + return minHeap->size == 0; +} + +struct MinHeapNode* extractMin(struct MinHeap* minHeap) +{ + if (isEmpty(minHeap)) + return NULL; + + struct MinHeapNode* root = minHeap->array[0]; + + struct MinHeapNode* lastNode = minHeap->array[minHeap->size - 1]; + minHeap->array[0] = lastNode; + + minHeap->pos[root->v] = minHeap->size-1; + minHeap->pos[lastNode->v] = 0; + + --minHeap->size; + minHeapify(minHeap, 0); + + return root; +} + +void decreaseKey(struct MinHeap* minHeap, int v, lli dist) +{ + int i = minHeap->pos[v]; + + minHeap->array[i]->dist = dist; + + while (i && minHeap->array[i]->dist < minHeap->array[(i - 1) / 2]->dist) + { + minHeap->pos[minHeap->array[i]->v] = (i-1)/2; + minHeap->pos[minHeap->array[(i-1)/2]->v] = i; + swapMinHeapNode(&minHeap->array[i], &minHeap->array[(i - 1) / 2]); + i = (i - 1) / 2; + } +} + +bool isInMinHeap(struct MinHeap *minHeap, int v) +{ + if (minHeap->pos[v] < minHeap->size) + return true; + return false; +} +void PrimMST(struct Graph*G,int src) +{ + lli i,j; + int V = G->V; + lli dist[V],parent[V],sto[V]; + struct MinHeap * minHeap = createMinHeap(V); + fr(i,0,V) + { + if(i==src) + continue; + parent[i] = -1 ; + sto[i] = -1 ; + dist[i] = infinite ; + minHeap->array[i] = newMinHeapNode(i,dist[i]); + minHeap->pos[i] = i ; + } + dist[src] = 0 ; + minHeap->array[src] = newMinHeapNode(src,dist[src]) ; + minHeap->pos[src] = src ; + minHeap->size = V ; + lli sum=0; + while(!isEmpty(minHeap)) + { + struct MinHeapNode* minHeapNode = extractMin(minHeap); + int u = minHeapNode->v; + struct adjListNode* pCrawl = G->array[u].head; + while (pCrawl != NULL) + { + int v = pCrawl->dest; + if (isInMinHeap(minHeap, v) && (pCrawl->wt < dist[v])) + { + parent[v] = u ; + if(dist[v] != infinite) + sum -= (dist[v]-pCrawl->wt) ; + else + sum+=pCrawl->wt; + dist[v] =pCrawl->wt; + decreaseKey(minHeap, v, dist[v]); + } + pCrawl = pCrawl->next; + } + } + fr(i,0,V) + cout<>v>>e; + struct Graph* G = createGraph(v,e); + while(e--) + { + cin>>a>>b>>wt; + addEdge(G,a-1,b-1,wt); + } + cin>>a; + PrimMST(G,0); + return 0; +} \ No newline at end of file diff --git a/Minimum_Spanning_Tree/a.out b/Minimum_Spanning_Tree/a.out new file mode 100755 index 0000000000000000000000000000000000000000..b763fff5e3ca753728b7e0081d687a7f9370d3f3 GIT binary patch literal 53424 zcmeIbd0>>))j$3`Gg*cJA%qYDVhkVhlf^;5Lk=l zI|@y)6|aZu7!IGI5`@q2NWj3`b$JGwd|yC5%K1s3ES+$rF0VhmxU~ER>f){GjiH)Z zrPCYhrZt9|JGM^SS~hFitWtM-i@QYXP5w-~bVaq4Wb{~o7-i1Ehc-a^is{qO`_4_@ zUU$jHRo`?y>^beBCvToh+7NumL)9w_W||{7@*av$`yJ_yG5>sTK%w_n%ZBeBv$Qlm0*Y z!T$sJq1H(2?xOVwp?`ocpZoElezLUxAdXK6AL8$JdGH;5Qjm{)_7$%eWR~V*!M@tV zb+uEb(57Ztet$z#OS8W{9B2#s{g(gS&Hk0ahERJr*tV!K(B2+wxBTT*%l&o1HjS=Y zzNoRKIan2_X$&e_a?08jmEp2bOS``&&>k!;Zw`eQ7kf8be&Aag+r1S_R#vuD`n`e( zwY7U!hN8i(2v&wmgUxk~<+YXJ;^Nv3fi{1*Ef5N~m)Cl|D}kEdo4y_K_2hrT5*QYBZ0XViw874O=Xj<6)9Fk7jXTB8vtqjsaecEd)0eIV2b71eGH z_yghK)==1L3N$vh)LKo!rlyw7sK1{XwfdR@V7_!&`NBp15_f4NRN|hg!mC&NX8^As z2l^@h@o}Q>Iuib=WHzw00rs;Zd~!me!R+Y)jq4Z{8o>M;b^F@r*$gs0pYWtx;W{1G z7EM1neZAn>_cco5#@;vv&_9^R*bnivGxOwW`%DKSmQO(pUe!(ID2%}y-%3hR3_f=J zDT~3!`d?2Bp1#UFz8E|d5_u|O@EH-TWv!0E4~)UDkHHU$!EcDcqX8mMYYaX!g0-xz zF?iD!B>OtwbosWY{%T@@<-2xYIJIY-AP=~njLD2(@60EVq<8!Qd=J4`)jOW?4NP?G zXfK}edl;wcj~$ly!;Et{IJQsX-({RlaO@$8e}i$V{@C3T{~F^|`LUf6zm@Sc#;=n2 zjf}H-kF`qtYQ{MXA6qZ+OBtuCk5x##jd7~@m`CE5FizDTE0TB(<5cOf0>q2oD(`xJ zov-WnzRuU)uBa+MxNkjb={vap?RpaKm zNIiZV@}#kFLw#?CR+G343$Tjt_f#eb53_08PBvMGYg+gB)z5-M;-tQ>gBsqpJS|dJ^gG-)?nz_esE$(&atiJLo-(RI~w* zP(o*qjVwoeT~GKRYI)ZS3my}?i636@V~Ka}vmuSsx1+-OC}o$7_Tk4F-Xkgg`hjob zzAWFQ11!9ApA((Jfh-QNKYGx+mua?p_nz(DcX=U7hc)c=)xNNO`QENUhokX>iw}!m z@AU4qj}w2tZ@X0Zel)dK$c{k{Mew-xH%y@$^BJ{!L16d543$A!B2YM=J)e-$Mj+U|1+ zBN6o|+f(X>RH6qh7rU_SJ$&5WNd+7$MTbDT!@jPke!?NN=h?sa_CC(Z8!P-ABEGKQ z?L>;6I^PV{{um3cCw}|I+C*R>MX}a#64tRpvE*po6A~^@0QVw_@pZl2vkI8))i0vl zu9r~EqJOd&@7o8xN1;x%;fq~fIFuK6RP=ULzj*DwAz$8i&AuVm+(BLMpd~%^6JeYc zVf;JI_@lp(6N~E6n9(9CT^AK`6b4}$sQO6f8|XPyS~BYIgvz$*Lw$n!@O3#ly+`e1 zRn%atRF_f)=0eT(pc#~h-M;)JG&o3l5H#pTqDYU;>bm^Hu8xzPmw#w?O#IU2CwqJ0 z!1I6ddQ2Q+9|?w@9|Ju?9M~}XP>Y0 z?Q>w-lb-N(9cH(R^PTAMaPnQ%J*rj*dqy%Rl(>C4YEFM37Ihx5F;0d~H?h&-SD*>- z5)Xc(5&%5nt9~w|k5s(?e2f4`rL?oXZ->wKZLd~kE0On~6eq>;*tcUYszsl!N2adl zeO-U2t~p^R0xe%r>+8Jy zh}AI)mC^~2L9F3m&moj_e4($i>4=TIATQS>(cgO%Pdu^YJc0_4jLIME*`|6S!rr6D zukTMeaVk;b%oh$jZs62b%L^t_9v6Cjsi-r0;B!4kKs`P}WrDIOgOCdly`{^N254J-U_nlm==xZe5$7q)60lfE6~t~P^W#U(?fks7+x9! z$dGI9W^=(0W1Pu?1ZXaNgmS%5st=)%BQW=ew7$Q9GOpPdUL*;{`?I-GymTz2te{xr zgTkeSmLUgFV1#7UX%_~{FSw590|BlFd$uq^7xi#N_o)Yo>GU4SI@So2*$E20O2jY! z<-M4$RTN{;P!>HF%^sh#y+_025jxC5vLl5+jnZ*_s*sae$DdE$evn4=3$Ae{{wOnw z$|D6GX+KMu%kq=Z6$+G^k4IZUS9!<}9&E;FFItAt8C68-d!wZn#Jh>Op3r&nj4RGS zuX{U7i9=%4IR6Qmj{iK$iCRHLk$?>Yi(b|RvBaWby-^XbhEYSr%RoZoET>~L(l;m) zq?e{OYAb`_$2hgoSz@`BMzeq$JH2Q+m0503Ss--;{}zRAPr~O-q=i(&L5fZPKTHqH z>mw@XL^^$JxjUGC7}B$c7-6;o8P!v)#zjvmwKOA)TAFd4;-0RW>lNJwluYzxlFg1J zLmM4`MT&%%Z%bq7I9zF5UEX0omiFHf>9X;{P-M(vSco`r$ntXUVU?KE)xsFVKY}tK z$HAU`WGfR^)aGE%e@S#ds7Khtx?Z7E{E-xWpfG-IakP(*fSRMj+^?BQCJFJwTc7GltxJ4cZpWWAWn6AwN~y zi3vK?8};nc+0c_@*+I{Ch%Vn$L1|za-Jf_C49HZ#_6{WR9$MbDU;Fw8(48<4AGX37 zsOVw)`1f{VLW?wU6?^qBF%@GApsB&B3$D9s`6p_L#F^z=fH*|1>&aLn8f;LDPUStm1$D}wBqe%Ua6Suw*qxHDv zMlM#ytd!IMa1svsq!peHLX0+4@UIY7jlH(&mTFN_fD$6fnMO^0?ZZz$xwG$%+?XpR)!&$j}`~T_edA|oD zUHeuz-|WvW>w05Z*9VKip*QDuzRo9Y-<;zeZ@^)?F1&cbMGG!oux^3>$(_;t+!IgI zoq`)uAc%#U!?I6vp1l)xRE+quDByPpKX9zKm&4jOpo24E_XhwM11>$@+uI1Z3O0We z;QfFP06z2Q-rg4h2VnHR2D{%&0q+I82rvcsPQdp7_X6f%W|xBLNGV_#unO>Iz%byL zcYAwp2mB`BBYNW}K0toJ$$v$Dz*T@R z0)7+lL%`#Jqp^E`J68R30h_S#aS>oP_GP{ZSO(Y)xDs$L;CBIE13Unjl4e=&0G+fcFA^1b6^&3HFj+13dR5Z8 z079L;gIwx78qHzZm#(zzty%VIgVJ3)?er|3Q}YhO$v^e>PG$oA5YHz*y@fjwDt*r% zdwY*EL1xyH%)E1l4BXTd9pyMjIwA#;PY&$&FR<77fRS|0IgxU>3cCKS-rhMNN9bY2 zg88dJzZ-O4EZwn45|ADS{SfG_arBK5`t6|SL7$^y>D5vGkAR*H`fagv$IX%aFM@t8 z=vT+lFOSgQ1N~2+pBqQ_M(8=v&rrxwvf zd4wJYeG}+c#L-n_Q$M$Z{v7E2$@d88e*?V`^@zyl92aSy7eTkt|98akzadiod!RRi zJ}s8MLC9kFIq(;kfxax3PJ3La(hyBKdAZ{*r0cJpF9Q7_=--Lu#}`4bfPeaR z9R0-zy&Loa@K@i8qu(8&?*;v4&?m&w14>59_dC#U2R)e`u|IsM^RJH0zw{<&XNvAL zz?09JDVFtkKYU1E4Em#>C(|eCya@DD&~J`wudYaYT?6_I_}~8OaWCj|K$r7g)9;lz ziF^k@p9p%gdb0f2Kpz7-$Ek?DG)DE50zX{>dVlSBCg^KH=N*qoen)Sl9TtN=ALBz? zEPqE+gkA^wPSCf+(c2>QYe4S-y+8Ty1^xG+_ov?jpkEHZI6s!Z_MK9H(7z7)@K}0< zs{dl(QZUXu1pYzN7iMPN;#ioOceB%*S+FBzVP@e?slLpj>(YFgWu58gXL?#Q%NAr7 zEyyffm|1{yNWU=CCHJ6~fzJ`}LHGLi^KT9OTLb^rz`r%{Zw-8|8h9H={Cpl8qTpd2 z7bLzoWb;Xc=AP#uMYi%>9tjQB@jBdQ;=@B^KIVS)X(}4I?VwA<5IwS z|D)a(26sC=1d%)6yHivgL#8~39Ug%h@{M(`7I>hJ=V>ToxDFFw3a1_%t@ANsZ<)?- z)^}JU$}>X4qiG%q8T@V?H*(8d2q}2sjE^ZF%TTG0Pp8MSQ{tvvOv@!cTGLhT&;Q%p zV^1vU0^P3l8gAC`It}m8@Y@>xNW-Tzd`ZJUYWRVMY1+$cBrS3WIl4-?7Dsge~qyoWMUxbR4mQ@?^ zLJyxknBDO?tb2g0!V&+gj>{?)@uDmbzOjoV-&k?$xU52f>(Oyz(T<@WNhzyLgublf zR}0p%Mr14cxjG)u@f&sgxQ_Se_%Da4^s*`hZcL7f%PJ7@yL8;}JEr5Z$^(69u1dcH zVLo^2_%s!@p3!kxwE;I`ghwc*zJ48-)fgzQJVlq)7vit#__rjNWnDK?(I@Em13GT> z^OTOu>IrG`N2&CNUZ&$lzMziFDhTOMoTkzn{v$`LxVhCjQO6Cx1v)OP802r$aZ|rN zIxede&>uft@sm{v;zju?E~^m4@7Hm|{|Oy8@*+vxb7-D=;{lqp|27!m>$5HE+wf0C zamiq$xbJR_w|^Hu?~9v~PrYh)h4;F>c9)P55(rw$JOr-1sW1T_3sz=n4Ogwo-tQwLu%TENB< z0gaUcn%V_yx>-Qm4+MmNDWKzofXyS}$5RJyoi1RTSHKs)AmEAy0iD|fTywL4Yws6u z{T=}~JTGAT2Lg83r<2(&xdfS;FA%WhIsuoZE}(O|QP4Yjpy?zF9!`9RmL2hXU?=QNZ1A2)Ji>0kePf zBZ!oi>9li(5~kQiK&NG<+2;vNx9=3_veye7U|%UP!+sPnb;x-y2w3^Pfa)P*h`eyT zfQvi=F7^vpcewz6w}AC~2(sqxr$VykJu6`TuLbD|jU{qHSir)Y1uXiGfW-#{cwZN= zByAj1E_gw(Y=M0Ir{AARHVx3XVWH2UQmNn3S zL5Vdi*D(kmW*mG1iR@7;GoOUz4?S>G4mLzR%(vt8p@QjeXD>Sw+OiTTLNy`FJR}Z0(N~U;MNgmGQ({p0&ZU+;LDc?xZ^4T zU%5%Z?uP|@^<@EHJ1OAn;IaDz z?0rGN|GXvOCz*xJw||m=C&~pp84_@yOTbU>7x2{M0uH_+;Lt|`p3a}d>_3|?;F)Rx z&o&D9`Hcd8@f`ur9Taf*j{s>oE<0l~;Q)KQzzo|9m>xs}+QW}Mn1%-aiOaHvAAg^1 z{hN^pzWD%xL;n{hH2mFc1jnSpUV_M#u@PTZ_B$z-H7vNv8venzkfsrBxrix9R4Ilv zhOOa$?}Q1FxIUhka}{vI9rkQ^AQr@3p^Qz;D_^Nj6p`~=8)-7^*U>|XxYMMua+U)% zJk!1p37Gx~L&;z|ReVk+YmsYDg%{m|G=F3o24YLNnQ8Lv+dvZ%6wxP*s9=H}(tO;J zG*TATVCC$k^4xYB1_>g3OmjKPva)%clJhc)DYc(PH)p(oWYJ>IZKRah?+;O0y3S-& zxrYZ^>aF2(?YZE~jJY1L9PY6n!bF~NmC71%40=dmZ_J%@b~^fDHQ3o%qoE5&);}^p z%lZ&bz?HQM^~}n;2h@Tr?jw4#)OiszW1a-o^;n&D%W#v5z z*{y=Sk039y-FBvBJ(N`o+_`ya6HtIX@_BFt6HG;RqFg0S(>6*o0hVuPT>+9KtBZ-V za-mCC)=HF}mGvZ;6pVCX@KCvf7}8YkFMp4@Jp~|S9l`i&XAOmV99f-^A!X$G%pm2p zjyE|Tdzm>hA)J*p2!pkq^#honV`O82PCM!^7?M5E$Z79^VCPmk?D?qX=I&>@lm6IoD&iBfD*9uLc-f7p%2%7b%ou%tsJ4cZrIn zjNK62YUP%zm}|^hG-mD!70ViPFIlZrv4XKJwP7o_TE#qLE}}GRRP3s8?T{n)A{Ddj zao3^IbJy#rV;quNxpg|4GOh_ST3YuxW(47r!+Xx6yLSeYgrEf{B`>2f#esAtR_ z&{}R-MIRbd&$L@q?A&n!UZL^psw6o z6v{E?Iv7Ci?JAZsW>EoRUr{k@Y@oH(%KfhWl*-J;9gCOitlS3`$}y%916l6FDwZ-9 z@6_e~P(@s0`O;qQqbim)<|zvNn2HsQtqC?*xj(b>(IB>!eIEJNcC=Z!KUXMwEM6zH zau2JR!%7{o@?Mxp>WIp(3aFCtaKuG>Bo=&8z=l5y2stqnkE(&@cVu9M-VSr78$R=4 zsPlESjy38Qe19i7%{c?UA#YK72FP~W!@mQ_EQMvH{jd>SGsmMBr2QxhJ#xS>m>~y! zD}DY%rhTyhw9E{I(_SKe{8wQ@X)kl$(*rK-KWcsu$vL4DjM*=60`WAasAPnl$G6kDB>WX~94d&(F%RmD&T%prwI=-l(-!9~ z>5q(s7ljLr=2(NQ6hjJ2$V$A<&qH2kWqLLwS{j$1GA3kGB@RRzIy=+<2BW*;<8rXJ zs-T<-_#@}m^w&@{v5$OQR#n(FvIt3k0Mq0@ezF|HsltWnVdy>&Z5UNZzZL3%6*<3@ zRu2B>e_W1eg(l5FgQs3+^Umv+J}#S7X6Sb?MmSd-LzVV2gR$OZEhObc3(N7rOF3)P z8(^Zu{`KPujLG^J^d|dK$9}XIvD2WK0X3MTFfyP)2V(4scxzG`k~{O#w?j8;nIp~; ze-yDqhO9|Dsfu~_GqCTQ`Xo+fL__}*-Y@kyFPJ>>aT%gj87i~?t^Wl__-E#N4rNO% zUe$qUEv%etU}*Mu`&O7S`~FaPf{4Z?ot5)?0h0I~)8V4Y<_kzNAq5o{fAH}-8afvB zO?~bJ4Es)UkErOCfvW38oJK+mOZSs6@hD;(IX{Lb?NN3Q@>1UYN#wl_BfY)cF$QGH zYr~NKpX8l@45?q_I(r2|A1Cj0*o{(Xg1jVHL$8I~OMfUAhPVmLB2~>8HWk_UWo6Sx zPks~KYE;#q@O>@PW&aaRp7|PTF!DwY4O94jxohq;xa=E2&in{f9Jyl?D3d?HmuucT z_`VmEse4e8>)fMgE0{3K9{Rsq(86ki;+2%4ulx#$QZrxT8aOrck40$O)XaCz6Y%bO z0VlZLP0f6t!$E512af^_s|#(mGXL-%d|Ig_i+^kR4*S4s=* z-TgC&lCnuW_Vf`DD5c#2_qze4c6{>Bpaz6m^ao^3x%6rHSlU!Ks1M*XfP#qO-lzjA z4^hfABO?SN5+&dar1;d<7dns88AhJ@yk)`lpo9+h*o3W z<5Ea(D&CE{q3*5Vz*T-<7JCk|K87^`^j_>?)87^~opj!FoG3;@_06&<&jA5U9Hmo>* zImM}PpUvVq5IF|)6DQi?ppF`VfbRJ zEDPgY{ue1UH+(aw%M2T;wC22sX3M{F9k8=q+!{ukESBa?y#ei3nw4@5NTsfnE`pSl z8=YvccOcdoXWRilq<<3?J2Yl2x1-$;pr|p0*E5g%oK%D-k*&vF1H_ogWZ<(hPe7D0 zMW-YES+4@a4Qvqwo~MQB&RqmdhI}zMD#>J-9T0PDAqCGo3em<^`;lz6D~Rv;t;`{b z&zbFFM0Om<9iiA~QJ>rwmqMIY*`4qYW9zGc;WoKaEMr#LhtT5K?c}rHP^`=$sNb1| z&jNAQ@9@Qs7B~GFC_it!#cg)?GsrdG;@*knz9$k+aeo=TXuS0nFfMls>{*4gtjt{U ztzki#i{Sny6io-4^m7nAGV%TI!z$d*AnU{rq+0HKU@{Z`L2GciOOR&bhYV-Ak3%05 z|H*Kky9x{@e#CHrdnUTY#9oFAJrmFp6D^yOBF|`Mwk1;LS&7moIwa!pyoAwfVv0n3 zo-0^hszfS0XCvptG>NSCJPjkA=(0DV53cv*qY@J{>@A3F@JvG8Cl0bHaI2>mrZ_Q6 zB4JM@BiZ&IP_}xWL*j|K_7#X+<@pDUVd4n;Hbk!W@DOHVo_#qIbb7vpW|}zK-hs#s zo>gQp-u@|)?ettm3EVbyy4&*|R&=^V?)F?wN|8kF_jEB*ERlyiI~gglx1hq0dR9c-RzkU4@muM)kN;wIHSNg4Y2T)`C#DnytLhje-j= zx*7~E_X}v)!Yb8L^T46-;-`>0#mf9G7!e!vFbxTs9kgfqt_%iLHx`k-b78v^vTR0pS|wgnxlV5}v;NdU zGxz~Xw4n^f)R)RX5o6ngT*=QCi{{q?{)yf7EfMC7dY56T63c_uSqoKzqaNfn(T zR3HZ+TWVpU-6y>3pf~1$ndbcxq7!n2H_y)$c1b&?$`eK@>_1tBE2Q>3QER2y8{_5aSoGNtjFwFEOEVFqk zr>a0bTi#CgkP7KMJgJM4R1;8{)|~ILa!*n*WsOkLgy)$z7kW|RdVh~~!-U7BLdC>V zB30~M*W{Wx1sGLDJBP*b#B(=OY%`Go(!t=8>v#A zzL8<{t22;da#KL1-@FfWt~^xwEnIu(^jjH5`u)I6-nI*AGOvO)OgZ~y@X34-UsKNe zJ-&Tg#~{J$jz1v9Y}YY-ms7HTB9IaJ0>z2>^ts;eK(~|ArM5h>%-BR7m5o5JoxF1! z3giK%ZlG~Q-bP+L&eTZ0!9Mv8R)zC(h4ijOS(D#&(1Ll^87(%(o?k{9>pU*ECg(V* zQ67gXWs6e1S>wQ@RE&v7q?$F49VX{GsZySpD%%#Vdar`lo4ihJo2RIfK?=0I>rku7 zA*b{v*hoeOzc^!2^x3W~AWBnGzk?ckUnxN1fbik@YhvQX6M>xkp@WCAiJep`wPY*m zJ$bX3;bN{yCvUZRW}6`+a9J;0)8u=p+nq#;6bzwBXo+QqV40Kun^oe`Zj`QiaM_D+ zcatBx31lAmCX&4eP^rn!N_+AwSm>6w8?%zhjjH~ropMVV3`w6r{SnTl61){O$Dq`{ zD3X*E%e$1iAMK=havdGBFfRKoy4&RcpoOj{MJ9t~_t3VUC-O>z%#b=u1DElTa`H=c zAm5pcyoY*t;3|+GjU!uS3&{8TZJ@jmPZ?hhF{ZBIH!b~rQpMz1psH%wG#KpEuMoil zZKXdE*ZVzac51gwC3wiK^zGdbF{WN9Se|(+)v5ZehE}J3jT+=Jc$A__8t;bzPyIE& znVd)Dsx+y6&N1}esf9KH$virb5oY|I6!SfPlgbnI*vz{q)FPXJWS*_ZWL_3-vdX4h z%cFL;&w^jLUW#=4Q0XZ*Fr4E4C3G~Ui(!|$9lDxwBg2E-UxaI(BJ<2F_r+j8bC1TbJLP7EN4vj_snC>L7%p%xM1fOorR5g7XTn2IxsAdVS#vIjublEf z9DB+pvD_zV{ak5e@N$5BS!L-MNTwVl;+v%K3tfU$EBiL{?<47PlK2G@#Y;q{ugRd!nVR5`_py*}kF!d=Xh~&isjr?)} zkUwX8R}m>=ySNlqQ_DYYFJW3b8Q9*A!n9M!m>O?Qy_ zznq0#!ik*s|G>U5VDl7(cL}upjX<#Qn1k5Ih~*dL=Pca2l(aM_z1gdziCbe^s8rrR za~}9t$;*of8SKWIbOuJb!okwbc{w3NoPqH6Zb1Qs=ZOp9g$2o=g}I&#R|<)j7!-+F zms{RVq+KR7-fW1Y?jT3>$G5ANl}uqepcD#Y_4z8ta(c%DvniFPqW%b3NNn2Qn(f`yp7y=mnD`P*9?Up zvPF2kB_@yeF4lXM43fO^lBgW$Zw??@=tT&XMXWlkiuBq{IWL`$-~?@_-` z*z~-vLPKH*w!@;mj&vk=+U9`En>#A6B=8O(X_U=myv-9+KSj?X{Y9IOj@NvmS+(1E zo=)!9_D!Jk{!b#kYz>uqfVH_lo;^{P*F~!iN{8l!A?X&DcN(NA^a_^uhoW^=TJ^Tl zSCos;yjTnS$#X=$JiwF$_Z zx1nM(=lC$<7S6Q^NantDG`H5(GZ>o+pRqZm8Xuvnw*4N)u);ssoW*(LNV;twVtwDR zIgJY@p|5c9vd{__uU5_0-wMN-eC92fb4@E?56-4_VBm(nq1=lkG1 z+x0_yXLAFq>; zX07{s%*wrMh0NwYb*amFH9Avima`a{OADM|LE%wB@* z=P%=zhhGw9D8=DGdsyjjW?%=zF`yf$rCY+5V;~i3Ep2bBwH$+35tsXiP?2LW!-K4J z+r{)lcpkF!0?RR!Xltq0a>&kgiu*suBJnViT@(axS$ju~<#G&v4`KHV^mfMx$>d%E zDIIwXrywbh(#~g^a!M};J&`Z86FJRx^~yKTMrONsqJlje%ylbx5hC$cy4`)zRBTfF z{ms1eKo{WHwZU5Xb4qyl@eYdGA2@ z(SsDzaWG{*cJ~rDm?Fx=$@xrbvl)9|kl^N~020qyQLko4kz3_^mnOt5CN4nT}G!AN-V8rX&;aP0D} zfo||Q(G4+ZLMDutg{^J$kMT^VpRvakHfEGRn|J*!AX35!tVA?$C+K9 zJ2?Ig&@^u8uy3Ii{J)2bh(y=>&w#BtTe5lX2xGI>@i;W`O$@txD_NUE%4+6G`BEec z@BSpdtYLTml35NF=!0N$IYmkH?esWlOjJvAUpjj#s%@>WX5dwD`T(E6BZx6jBLcL` zS!p&;qib2%_yM?CkmW(ESQb`#^4Q(^McDMgr;c1u|GGB>uD90l0#f2TBzE_cNE;P< zO+msXBPIVWTK?5an>%&1!e29lHj}R0hEFMXm#&UyZP8GVNEMK83@{cZbIz|DWmwia zUU5o%j|Fuoj+H51m6ay95~WHO@*xfgrf^}zv^=@{BYa*=0gs#=m z)vA`)MN8tXsl=CU?Cy6@QPS23FJZk+M=KQTZAO8?S25^2FVoZw);eCYN_>sS?!L98 ze|1ff%+6hpUa9moRmUH?Qk6AT%5v_y`^vSWhpE=OTenud-ygD^MY?p~+AnDO0@Ip2 z#&gb0--{86#*60Um9E6sitO&p8U4$*P_x&TwMa*`CKee@to@TNe0H30UY&dc%I4*; z#8;T??ysJr>@TIMUb)&Y?R~Y5Rwzw%>ZrEr&NS6YJ!>m+JR-!hI8mIRe6Q740c8Zm<%t*AtPpw9xK5HE>v?RXUW_Rx)Yq~CaZ8d`YAkvDwvzPe#o83KO zR-#5ZcT+0N6P-yvmJw`ZI%&>b4_z6QZaCU>!{9pluG6)OAs%o0CB9l`cfZ)DED9$z z$HhO^JmNDVaqTlw=ZiVgXZT*hSev@QrVH?0j>@JkvJWC0d<+wlRGeIVP1cb*%M`i)La|qg2q(@)33OuXczrSPO+&l;E(-7*Bqqbi3rf7biS{Ca@ze#+N((djA<#v4P$c2-P^98QA z8hCFl@kL9!`==oP8K1~)v4{qw2eWwgU|Mp@{Y>cCwZ59VNx5ICX0=*QtmBo=#P>Gs z?mOmyb;K3*e_K--%yXJ$^*zI2Fwd#EOGUMq>|s5VsTQj^%+(a_MVZfG?GabqnTL!o zaFZBPuR5;)v0ti;X!Zk`+$X+DYIh%{i2WE)FwTHL%^w zh}rPEYU1mucK3Xwj3`=}+Nh|h@j`0iE39_+!^rdTrnWrZ)J#;Hnu+>?eB;qx>EJy( z$F3G@9dGs}z9wsTzfL*hUFFvzu9BBx6W^q@yDvTa<6E3dUe)4XjBD}BO^Zu2>X=Wp z_~r2}eg%1OfhE4{DwPrQFkZJ!e4W?sei}kW?#+sCNPmbpctG(D=@0!vVxCpM0o(K+ zvn=|Y=yDn7B}kD?!n$b#u`tQ^prP^NmwZE)-RI1WDMR)9c@Dn9fW?fA6nMu$MRjA$ z(@o_Ix>2aT*umSqFk5T=Qr2xb_|@PeZh!&h2D+3R;62b<7I_j|{rBg4M2t}pVQvKF z>-f}>3*Ep40^tUDi!|~5WxM-Xkl)8AVw4eoAZ~!g(+x<+zeTm#dgT;uVK%PUL|2!* zavBcghA467N5mF;8UeBA*iP43 z1J534gN<{J<;-LRF7YgjfjnSSU6Ej#1XGDkA7(o<2M#n@U2glFkt%a@=3MNN510;K zcFss@sALhv(HqvWHs@sZL7Min!m2r`!sBh!hI_7(jXBBzV(GAWV| z3RP8~T&mlRj8t8x02OHog_>$ov1zcM3&RszqYg0st4R5Zj5h&C_SA&Tl!vw+g>_ssGXhe$@|Jespl6`BSz^!j+GH9#oXeOR_dfsJd;)> zOL~XmT8*T-1(@`L*rbZ5PPi&+ZA`e@*dyC^O*BH<+JW$k+3=e zHOqP}yN)(QMW`F5h1g&Uq6ndZb~W7mC2sV#(vfj0+USNrF*t0(vn+PuQgK*K_;E#% zp_zf^On5Y_MF*j-Rvm;N+@ymr;x-+Gx3Tu2V>ztlPRt1Ge`F5Ew~f`4g^xYGqrGi< zsJXVWqb@idKa)9q=JXo;>ZH{dACJNhwfbk3>R)YbXzn<5-syG0nvRBe4yv%=)^I$! z592=KsPyUHk@FzLl8(81-+B(`d1{#-FR=I0iTcLwU z8bxny3)TheL(RcDe@kn-!ja2{V4yV`3*qNN1L2l7`K?cXcw1{wC*_Z1s$}>jQ2C)w z=-sNtPiO}4>!A#`2g8>%wW?sKp*hf~g5kPATZ0LPT1*I))WNn;v!aJXO^VZ$DYY%l z^`QoohlUjeBbb889ctVb3U6qt-%_W9solaK6ctX<9~O~`RWt8j;M_w{t(aB8@ZcYNkxPi{Gw;TcX05ooeS*gIP`VWHjH^X?M9)(l(tm z6&f)+$($4Jy0ShKC_ z{2P)Fbe)Ta7=z0w+C0q8sPo}?^Dx_=&aY(J@AkN+cdmi#YdWh+A>RmQX4TEUrE{+X z&G4pci))SRTGt83gq+RjEt8!YbH^#|GqKq=biQHRuJD^^s5OrH!-W~BW>3%gSIc&e zc-J*kv;czHqI2Hsupe_|sydlHIOi)VwkzbAJnUu108=Bg9p=2pj#w_WW467V_n~~H z9jS!buX6svwjGm(cXqmt{PD+*sX1#LGln_0UF{qoicZ^;=DPcJM`_MpNAYkYo7qQl zzGm6)nTAV4S!P?v`I2pSI?|NTW(Uam)tH)?Egt8ysLA5<(FvpnQDCzZAGTF#2=(1x7inQe&4p=bq;uq?V#Hf zRI{Vu+zW9Qxz=fceDrVO7Qd4_{nO2eW)?m++x+XG_^Jcw-(g3bnvIUn_I$u{_&b{lfOM! zO9uS0ZVuDSYI+=yi{H@5}>aW@6Z*L9M z@+Yx58^E~I)au_HXq;Qq($ZK^IC)ZGu&yCEVQPVZN%O7Qjg7cI?}vQI08y8;v~3Br z)s^e1L~$QX2}Rz}*0P0pE(kPspe)q6EnL%44ZDPGkmz}?G!7?;cM~%PS?_XO=ucqAuRPOf$+846& zZNcUMRw4eiE7+_tH7>99B2Vi!Z$&M8J60v^&}jTws_j30vrC)H8VJgS3&QG9>@!T; z3pIzrp+IBk(x4xn8!b~O9=pCRQ0uP?HE>-kUKmNCnrI*Bua~igNj&MP`p=?LFPsPp zFh0l_;-~5A^$kIYE^eh>0pn!gEzx+pQdPrU$YGbRx*lR<<=5VM!gyGW9MeIfyzBuxzZoQ=`*o1x< zucngH{+u+d1EWz>V5=87W>zW7bB!~KQ`9yT zscpE$uR00q7nfa+&Pm6kIHxSbbD0{R>Hfr=YGKB*NVmuze~RT_;Jv6s3>L$Yzu8~g z?#B*DE%rd*#A9v$6xD2uR8!o(AAa8-4q(cFZa;@3jGqIh?)fw~jIOMKm~%&?#c`pj zMoq(%*==iv1pY19!tl$I-ipj_s6~rBG0H`}EFJq~HTaj5B)9le89e0JTHn@$o^-wp z->`9@FemxM8fcGdAel!j32ySPJg=6WE20i#uv+#&J0}pB5ve^RVnu&&ruYkRFv$AQ zR@|7}S|12+P~!;y)El~<8f07BLfrA$X4Qr2>w`2_?e#G~xwNIZKbwnpf(cVX?+VO^ zFl~%?c2%%IA@s4>%Gn@U(>Js<1*bO!WR@0aoDQG6p`&K{0<$I6K7BcybW=x@zp^#Z z+>DJDe^px$0xm|~1CU#)U5sXgD~IWDtktH2ayf@s5yeB8;u%qEKlQ~AbVZTQm-OM0HD_%~t#7Tn5ZNHSBHtydwi zhY)ts8Uo=EJhQYtYz}*AA{|q4;;*_$9lQ|yaeX+5DJ8op{ZZ5xRfbEYe~Gv7ZpM^N zym)NqjVuA;+cJI$p#1>GX)cJMv<8_ds9C)@|KwFFX$%|d4z$Og*%#q z^BRK9+;l`VfC=b4>;_MpRa!8up~T5DTN7){*LHVqAgiMNH}QQSx2Bq>I% z(BMCSZfj|?YB6mH2lZeBQz^mJrK7o_10yG#Qv9&<>Fh?_IGhewonq(~r^m)K^tX=W zysgG+!oU~a(9+Q!Xs*MIE{J8?T3KbO0Tt@RScchMWIEWYCrIJqlCsEZkuAh>0*$R3 zuyn(y-U^@F7;1vrH`nWFH9Aiit=5D^bThGVHqBwqw)KpPJUA%?Yz)@3C0heni);5T z!)0Z-jEik1D`lH5F7?V1p2&K=(i2nRgo2Y5t6oOqDxw;(bd)`SOH*K*xzJOmR#}eZ;JRdb30LA9jCFdvS1ifEgBshpiJ7Df_0$) znz}{J%08XJMc1@kkF&w_=+YKy*bvrB8hvi@u}hi-(XDZry-A;z1u{LY>Pz7bAvOtG zT)T3mFl-*cp}=IsWnv1z8LKQKlRC{=YJY(H2mKgCN$dnme5-#2-k6|4hXWyPf{6>2 z8CX5Q3?YLa{wd_gZsSB}q;h~H3khZGn8Q%K=z8H4bEYP5ndv`XhzW;@Zwvz)(48A0 zMi`52%-hYB-Pl=VrlW?!=yn9=H^p9W-`N)TcJy>>o0&Vrcry%;VXT;1noR+p%8>mV zS{j4p&2{*j!2PWN=BnK)bl&+?T61mdHkx7k#!%~)_C(K&)w`*1C3^H$oTCLXqPJnC z*Dmv(WFzb>HI?$Nti_ZIa)iRzSu;+SqY>oiq`9K4wiaD3 zI+|jY*S@VCD=LeeaGY1b&Lhhgt{38C+;LUIiYyZ??Uhh|bS!SfF)j95luJH^1;@>L zPT}1#L~{O&cB{b>vu&HT*^G5&D_Jz8_mg2qTj~NZU$*+JQsknMz@B9hiRk8blN}qI zdPQD5Bd%X-cP?x2B0m~QFTr82+`Q1^D(95-bjaMF}KvvDgGwN31=b?q&F<*O0Fh6cXF zEv?4)B^$XgY3D zpjNCyF`RO)LNm5vreRcly-fb;(qs?#6LmZ6u1BVF(j1t^Z^R0h(>turuqft+vJ~CX ziWz#X%rxWr!e^mb8W4O5B!Jt&N0vbSI!cZb^Eq+AfAQ?td=E9DYwF`D<*O~MYy;eK zlvz%_0vi>;lmx3d_|nFXCYr0PY@<_G-P0Pe0*{$bM3!;!jmKqN+|dR4cI5&;H}$xk zmu!%nP3yo=$|)5l&rKE=0hWJZImXI`GU>(i;cA1}xKUYzBC@1>nb+bHL!DG4adE2UJ`0P2m~Fv&wZKhSaq4-EoE~8b z*Ct0cP(LRU7A6qEjS|*&ft`w&V~tZquCvY=moA6(- zGPR=_Gs8QTUrlPpSo1SabWM}gjrP$u{V4Xqq-MqB5w}VGua2MUG*XS&?aRgSD^r#l za#TbspzUUqpd)RfLY0wYQL&{~#!1lO=5c@=UA@Ryi32+xm!iedHmVnfcxaBD#o)%e zP@9GJLU%M;ub;Oq75PL2UcQRif#paZb7V11SLL3YeBmhJpLPVX8`3V%CR((1G|#F3+SBV4hu%ZHV~Ja*8t5p#aN7-8qugMMU0g?|J5*u6{ZtP)^&BlYON1-JY(1XSDQclM_N5jaVX&Rp zftw$kf@oJ6cM-%4H{5Cqw6$?ct~Rp06;=L<^D0aI@TYR1D%U|utfq}>Y=^1h_iti-P`tDKEIbEP zD+f+uuJJpVFf7@@R711sF>r^vEn@d^Kh>5>ti{iOAM@hEkAIPxyoq&jqcGWlXum$V z&zRN637cgar^1zb9Ecpx$O)}~5hlP@%DTBxDW(_W^z=#1@+iKalNxn_LoRehHipoq zaKjyq`pQoSjIl|MHZfy{ynBR%GK1j#B+i~f*ayed1;=Etr>$FyIbmT##BBzD zn%1bVZ^Yg*MZo?5m`AQ}d=|Dwhte8<{>n=8pwmc7S!CODo@Mju6qoELEzRb;LbMe_g zb7|N>b5Gbnb3fQXb0OG3a}n4;bKloMbG_Fb|wjqGN>#p0@ z41Nk?m=+4|Ft%fD85i+`))s6GFoO=Y!X>$7H`I+2UWDOyL!hA2T{3(Qe%B!xemMRta58+Zb#i(#JYHNYN`}v~u1bm@Y2BR^Kgvq>I4!*2o#b&^ zqmy9qcC>}p(~~?-D?bUA>G5|7k~~hUpbwU>#idy9^d=JU$4t;G`sx$!bfQ-bwki_r z!L9K-6YvW({%`_*mGB>F9o8?SQw~1$_}EF>cL(q+_w58eUzPNI?c`D5lhx~>q#tRS zm*7pgFKPaXuif*nUb5UiuhsX%e*)6m)=+ErL=RF#pHjj1)hAOVlhY&V``Y0Jz~ja9 zKK9?B@rnKAQsL9r{yTv$u=?8b&A<<}qV}AJIG=j~$3hQgIxtP4tv58@44cIoKNfG! zWg~s!-vlhv`1RTkAS#a!0rEG)yXiS!(&>%=nXJ>_pwpY_%@rDdRO8Jw=|+wB;$1fK zH`4_p|8|Wx(=t=;Pk}Gcd1Jwg{os2vA2S`CqcdgV{X~{)rX6_sTb?rDv#q}VbG}Y* zrcvL~>Ax=NbtDGt>j(d0Kll^<;0NP<#$@_mqVZ;$)27Q_r}1X`dYi`Y(RefMG5S2A z@n(9-{>-NuFGS*RNLY6#j60VCU%&(j&mF*1PBV@CmZl#EerU|NgKEn2cj1qA&+tgR zQ=u&vUWY8u;aD&h_^c%TfLdJ>-1*&ZuC=xKPEyxW|>h4f5GQ=jW^4KUn{i5pMK6leG~O_ zLZ>&=XVZV@WGMU5*(0DDc$RCHPo`b|Q{&CF-lubn7^u>l<;^mUUjRJqGx1rY(b`&GNKIv9b7b-b`u74?wslNQ zP8H*lMh`;NH7@LzEW?#7eNh#6DfzMzPJutci6q}%__!Bm{7Y6YSnlOQ;Ii}B~9aS785wSA`(r*<64{PTrD9debMdejj&XQflzY?)sub;eA{0%1}b* zNGhtF;)$e`IYCr2BTAa{b9mQ}$KoxG?cS{klFM~FO{-Y4va+Sp?@dTThoH}GP5l$O zFbOy{mekLdZlNVHuupwqF7Zzdz%0W5zuYT# zUmcFfZ_YS^Fcr1>Z&zd1+c&wTNzP=J4*Ph>RmYqWJK0u|>eoO@34VYjpmFlFN#m%O2JF%XEdAA6szzyMOYS{5K=UBszKI{5DS~H2bY8 zmy*?l3A^x#&2P?mJv#qUCW?8oblAY#5s%Gp&SMI&FUx0Pu7c*<o9|G8#ls-V5Ij1{0jWO=6#y^Sqp9L9Pl9Bx8{M+SL`4ZD7 z#*ZKw$5keyh9;kZ?*Sj1-<;!LrSls(4I7is#Q%-}ai;#}ynm<8Z^i+W zzQ6=D>;+``I(dX@@~@0wRDfyu80bR4gcU`7|6Vh^${405CZ-+HPyU)2D#Nq$V!8G$ zYg|A1-J4XtR@3nPlwaIW{yX)C{(%IAC(1uh=TFpM%~h(vRpuZhp?t%~*H8IBzE5Si z`(yMs6v<56>mmfK`L2qobNML6lxr}ICln#1hrXv$_~`WUjKgOZK1LnJ|I Date: Wed, 30 Dec 2015 21:28:01 +0530 Subject: [PATCH 07/32] Longest Common Subsequence and Longest Increasing Subsequence Problems added --- Longest_Common_Subsequence/lcs.cpp | 73 ++++++++++++++++++ Longest_Increasing_Subsequence/a.out | Bin 0 -> 13600 bytes .../lis_n_log_n.cpp | 67 ++++++++++++++++ .../lis_n_squared_sol.cpp | 73 ++++++++++++++++++ 4 files changed, 213 insertions(+) create mode 100644 Longest_Common_Subsequence/lcs.cpp create mode 100755 Longest_Increasing_Subsequence/a.out create mode 100644 Longest_Increasing_Subsequence/lis_n_log_n.cpp create mode 100644 Longest_Increasing_Subsequence/lis_n_squared_sol.cpp diff --git a/Longest_Common_Subsequence/lcs.cpp b/Longest_Common_Subsequence/lcs.cpp new file mode 100644 index 000000000..e931be526 --- /dev/null +++ b/Longest_Common_Subsequence/lcs.cpp @@ -0,0 +1,73 @@ + +#include +using namespace std; +#define lli long long int +#define infinite 0xffff +#define Min(a,b) (((a)<(b))?(a):(b)) +#define Max(a,b) (((a)>(b))?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s , i--) +void lcs(char * a, char *b) +{ + lli lena,lenb,i,j,count; + lena=strlen(a); + lenb=strlen(b); + char record[lena+1][lenb+1]; + //Code to generate the map + fr(i,0,lena+1) + { + fr(j,0,lenb+1) + { + if(i==0 || j==0) + { + record[i][j]=0; + } + else if(a[i-1]==b[j-1]) + { + record[i][j]=record[i-1][j-1]+1; + } + else + { + record[i][j] = Max(record[i-1][j],record[i][j-1]); + } + } + } + //Code to find the subsequence + i = lena; + j = lenb; + char sub[record[lena][lenb]]; + lli index = record[i][j]-1; + while( i > 0 && j > 0 ) + { + if(a[i-1]==b[j-1]) + { + sub[index]=a[i-1]; + i--; + j--; + index--; + } + else if(Max(record[i-1][j],record[i][j-1]) == record[i-1][j]) + { + i--; + } + else + { + j--; + } + } + fr(i,0,record[lena][lenb]) + { + cout<>str1; + cin>>str2; + lcs(str1,str2); + return 0; +} \ No newline at end of file diff --git a/Longest_Increasing_Subsequence/a.out b/Longest_Increasing_Subsequence/a.out new file mode 100755 index 0000000000000000000000000000000000000000..4f7b1a9728c0681ce1f6577a88fd744877929a8b GIT binary patch literal 13600 zcmeHOeQ;Y>mA{f4+f7|rDJeM3woyY1NsCp>ae~wAwvrtsPsK@$KT0Xe@ z=_xqf4Y(`XMYt{*K01LJhQJI=fj=<+Fex92l0f4!omscDuwm)$c$n?3+!RPZ=(^pu z-ru?J9{K56>ULmuX8-W@Je_-f_ndR@J@0WSI)#l>q5cTbFK-Ea^Ipb+5HCxWs}&CUU1ar zjkstGPLJj;1@C{;RrTW?A);`wsRSor!c-ABkk+9pO~M*y|4+6*};AG8^jM*Vmu!*FzFWWU`^Y zNo4ztj(94T3`hG7zdt$_$>>HVk}$I2XeiVNYzK@bqIx=OWa5$W@PIzhric1>q2a5m z>o%+FH+Do5DQP>I4Zl0P(E(W9srP;)YPKnw&Ka@_YWXDjFv{+O=b}gS=-3f`G?GZd zpV7&P9x>vR325jfshm3=K`Zw6guA-+c3($1*Y4YC=I^~%-vL}DCuSwhJ({m|__h9# zhyzFn_mt*S8?KFs1g2@7__V@u*C(!`nO#u#-2n~Ck~}42`xmf8I>nb&`O=nQiPPGp zAj$JMq_v*b0Zu%w2xpsA)}qF31M*foUJFkB;hTd6)r9;Bi*u|cyi(5yyTt4({NZUO8$-afp-x=ko>d6)3&)dEcss$PcB>RmHc_)$yJL1 z@c!S03(wrI6@IJb|NTnuK=@*@7dxbO@!Y~SL@pj~3W(Bv2);Vnyk)Ntr~d(t8q`{8 zJZbqQw^n%m=;qU~Cf&1P=qwd1FF^P+1d5>xu%XbHVUDVzo-?^q6?6n)$%0=Fw}Kk%b$0I3(p3BEbC%^KKO*> z^F@btZo#F^^fsKPIV=?&^G{IzM^fUyUeb;fJ=*r4k@bAB0q%B56*Li5oz|v3)HPx)_||ujD0mis@J=@7v>9z#He*YarY<)NyA)GpYZFl`o|(F!kX7oWu4U)Bm2ORv906gRV4 zm$(kx3Ry?dvG~f{kSBwMC(qKNS^E1omzU4bHcr+a0z)oC|4b+C3C$gEg*>&ih&znC zsPyh8y%nXg@Q+RDJEG%z)PRn0#XuB`xUZ4%- z6GPmK3nx~peB}ZL6zxH3%c185FWTnV?Ak+T7FyUpi%L#`YUsoS=$&xp9Ox6ECD3II zb$V`WL3aY6_ka$APJ&K>mO$mChb)~VC^;VJ6OKubV{=nO;|WKDhj2PO&ZDkdNkFCQ z@x(4o_Uv=F+}(WjCmW~4UDxlqb;r$H2__kADpKE%k`H|DMM->!u1HQ|HN?Fgg%w!4t(DAXx+@ZN9ywpt_DY0 zp6dMxu6g+8PSCRaF;j%fpTqTglwW5p?={P*&2Qqmg7P?(cey>EcXqj39(9G>-kG{C z_qIpYY3{a%>os?0zTuENFyZbDy4!;8ZC!3J0 zYaUqhz?uivJh0}0H4m(LV9f(-9{B(5fvKwkvVmvt+LY3;;w6J0I+9YdQ+oGLsmUZ_ zz9ArU{EmLWZStE`Ie%ZJ*U*&c9UrCZO(Gic`jZl!Un$`TEz=+0UQScyq%%OI{LOc) z&gA)9=e*P8=>;*RZ>aY1JMMlC=4ySwl3ZW|oQrHq_+r?1`TZ*6bSNw$5v33%Jv{5$<^ z{x(q|+~M2pYj5?pnZkbmcCSQ)@MVvU8<7!EBV*Dr&LvX#zBnO#sk9OI1-rtnM&z*K z4ySUykz4{Fv=cGmBW^5`9TUFTu@vl?)X116N8_1nBAu#Wbd+V{$p|T^+(gn4z63r% z3Ln19;dc}a%F?lj5fQ%lm_C|`jK}q{7<8F4HS|a(6FFvTaQ<(i5QFu|cp{3b(=do1 zpRC2SIFii@Uo<^F9#0t-AJ@vdFuOaQfmOvW%!YxgxJwvS@w)OnwHk9_*7E$U#Ov|J zC}4$T-X$7Dwej!5s=)Kcs^r4kM4o?@`1iL^$ER48T;e_D^|BJ*DCjeiJ-M*zRh!=~@m|5- zU9CDUfmKeehn0AXn5c@c#0yl)^Xk5W(z047UZRgO6{!iF18)`W?Wg_2i7&qkwspg& zaIbB@3M$;bk9|zq-y~+Y4kNd+pN-1=YJbiEr+RsRBppg$!R0{21Mg=N#LsD5)%rCj zWlxFvPwAg=N&9NwmG5$aH9&xH-j8{|BE4$%TT$S^_|ZH8NUS7^2dU;ylBi~9 zzm#8n--oDT^q2Q%;wYsQZui53($4Df_Br5Qv3mT__y20~Cf@^oE&M=Vbt&=w_+y20 zT-vR&REYBmziE9yBJ!O(a!&*IN~H4VH#P7-NIR?N^&cf(X@j`y(J+dCv8UZN@P38c z<7Fm+d+kQRf2oF@UjyHO=qFxh>XdG&h8-s!bUao3-wb?%v!xvG!%f&sc$N5_b|p{W zp{(gH;B>#}^E)N^Z2|Ouu+u&I88-0qjrrUv2e<{v@lKgf9+9B~O`%5%qWR2YDs1G4M`rX}q zdQZ5201;0sflazGu16`fDJwXl$pYzmEUh0-rbi-4J!YgcSv``Q6xie^l5ry*^L=>d zu1;94BBayfhWYTIW>J?14&dL=Wrw zeTb+^q#~JPdQUoiWN@N)5(#bE*B3kx(nAOLQcRe1m&z;sL;LpihY)=g?CJ@TL`Az} zm4J*b6Z+nd9}FG{cMEz%GDD(dXDB!;5Rh?EDgsJHO+~Xg={Zpr-T`Nzfw2C+$E?Xm zyc$7aRjV^2;3!B-6(dTEVzaCPUAB_dA!iifX0!fI!E*?A`x8Ra>=hh>gJOx4p3BDJ zd8&_xZ)K>SZuPv5GQPhQbw?3yHp6->o7TrLiYU&{jAWyGqQ+f~frCe1zF$Nwp>ZqD z>sSe;vsH=Mzj7G|2--y8bTeAej{m8lgEl*H`3NtA^~|oy<>k-*p>sF3u<}02&-)yA z&F5~eh-9tl{b1;+^YJUI8anhv|I+Wm&%kc}n--!WL21=W~mUcmvMw z8<3UB?!Wti(pjJD=kv{a^#Wt7(p#q}%P~CyoZcNU&*z{vrQfUch$R_rzk8#mCb`xAp{L5_qdVKR?c@hJKSBZ_`t(_^M5x&wT@KQ-a^~u)Mwf zr<6YXpP$=?l|K8Wmj2^5eLhF>{|5}PqN4Wte`wR^^JY=i|A=kC^8I78MPx{n<^Uyr z?&tp(U_YCsEBBxIr;%yK#rk}nXjK1CVXx25UxF?*k@fkU=y{j={|a65G3)brxJBtN zsQ&YP;QF~=|6!}2&&^9)P=LhpCbz;fei;SU_LtAsUQ=U&6%}PYrmq6G>hn2#!fPsU zJC*vX_Pl`tvc>)9=h-Q*sloez$qAugW(6JCss6SyVrE#s&xVsMC8isY=elKq`gzuC vW_bPJGS;*5Ja-r)x^R=pO{sO@2C&pd_8YH1G(W4=KfK-4zr!|R?DhW-a8kfV literal 0 HcmV?d00001 diff --git a/Longest_Increasing_Subsequence/lis_n_log_n.cpp b/Longest_Increasing_Subsequence/lis_n_log_n.cpp new file mode 100644 index 000000000..931ddcb1a --- /dev/null +++ b/Longest_Increasing_Subsequence/lis_n_log_n.cpp @@ -0,0 +1,67 @@ +#include +using namespace std; +#define lli long long int +#define infinite 0xffff +#define Min(a,b) (((a)<(b))?(a):(b)) +#define Max(a,b) (((a)>(b))?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s ; i--) +lli binary_LookUp(lli * record ,lli a , lli len , lli val) +{ + while(len-a > 1) + { + lli m = a + (len-a)/2; + if(record[m]>=val) + { + len = m ; + } + else + { + a = m ; + } + } + return len ; +} +void lis(lli * a, lli n) +{ + lli i,j,count,index; + lli record[n]; + //Code to generate the map + record[0]=a[0]; + lli len = 1 ; + fr(i,1,n) + { + if(a[i] record[len-1]) + { + record[len] = a[i]; + len++; + } + else + { + index=binary_LookUp(record,-1,len-1,a[i]); + record[index] = a[i]; + } + } + cout<>n; + lli a[n]; + fr(i,0,n) + { + cin>>a[i]; + } + lis(a,n); + return 0; +} \ No newline at end of file diff --git a/Longest_Increasing_Subsequence/lis_n_squared_sol.cpp b/Longest_Increasing_Subsequence/lis_n_squared_sol.cpp new file mode 100644 index 000000000..471a6aa33 --- /dev/null +++ b/Longest_Increasing_Subsequence/lis_n_squared_sol.cpp @@ -0,0 +1,73 @@ +#include +using namespace std; +#define lli long long int +#define infinite 0xffff +#define Min(a,b) (((a)<(b))?(a):(b)) +#define Max(a,b) (((a)>(b))?(a):(b)) +#define fr(i,j,s) for(i = j ; i < s ; i++) +#define ifr(i,j,s) for(i = j ; i >= s ; i--) +void lis(lli * a, lli n) +{ + lli i,j,count; + lli record[n]; + //Code to generate the map + fr(i,0,n) + { + record[i] = 0 ; + } + fr(i,0,n) + { + fr(j,0,i) + { + if( (a[i]>a[j]) && (record[i]<(record[j]+1)) ) + { + record[i]=record[j]+1; + } + } + } + lli max = 0; + lli index = 0 ; + fr(i,0,n) + { + //cout<>n; + lli a[n]; + fr(i,0,n) + { + cin>>a[i]; + } + lis(a,n); + return 0; +} \ No newline at end of file From 05da11d2dd58d3e454215f9b3ba80196840523b3 Mon Sep 17 00:00:00 2001 From: The Gitter Badger Date: Wed, 18 May 2016 17:08:16 +0000 Subject: [PATCH 08/32] Add Gitter badge --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index efca67af5..b9c91e9f7 100644 --- a/README.md +++ b/README.md @@ -1,2 +1,4 @@ # Algorithms + +[![Join the chat at https://gitter.im/codeIIEST/Algorithms](https://badges.gitter.im/codeIIEST/Algorithms.svg)](https://gitter.im/codeIIEST/Algorithms?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute. From 7d3e348f86bed6fec9bdc388fa0a9185c30378b3 Mon Sep 17 00:00:00 2001 From: Binayak Ghosh Date: Wed, 18 May 2016 22:44:37 +0530 Subject: [PATCH 09/32] Change the location of gitter chat badge --- README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index b9c91e9f7..ea36f3961 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,6 @@ # Algorithms +A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute. + +
[![Join the chat at https://gitter.im/codeIIEST/Algorithms](https://badges.gitter.im/codeIIEST/Algorithms.svg)](https://gitter.im/codeIIEST/Algorithms?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) -A Repository to store implementation of some of the famous Data Structures and Algorithms (mainly in C/C++/Java/Python) for everyone to learn and contribute. From 9af37b002a15350ee9e0f149c9ff08b3027ffd3e Mon Sep 17 00:00:00 2001 From: Prateek Chanda Date: Mon, 24 Oct 2016 22:40:42 +0530 Subject: [PATCH 10/32] Create READMEDijkstra.md Added a wiki for Dijkstra's Algorithm --- Shortest_Path/dijsktra/READMEDijkstra.md | 62 ++++++++++++++++++++++++ 1 file changed, 62 insertions(+) create mode 100644 Shortest_Path/dijsktra/READMEDijkstra.md diff --git a/Shortest_Path/dijsktra/READMEDijkstra.md b/Shortest_Path/dijsktra/READMEDijkstra.md new file mode 100644 index 000000000..13bc946ff --- /dev/null +++ b/Shortest_Path/dijsktra/READMEDijkstra.md @@ -0,0 +1,62 @@ +## Dijkstra's Algorithm +--------------------------------- +--------------------------------- +![](http://cacm.acm.org/system/assets/0000/3432/072010_CACMpg41_An-Interview.large.jpg?1476779421&1279552189) + +Edsger W.Dijkstra + +------------------------------------ +Dijkstra thought about the shortest path problem when working at the Mathematical Center in Amsterdam in 1956 as a programmer to demonstrate capabilities of a new computer called ARMAC. His objective was to choose both a problem as well as an answer (that would be produced by computer) that non-computing people could understand. He designed the shortest path algorithm and later implemented it for ARMAC for a slightly simplified transportation map of 64 cities in the Netherlands (64, so that 6 bits would be sufficient to encode the city number). + A year later, he came across another problem from hardware engineers working on the institute's next computer: minimize the amount of wire needed to connect the pins on the back panel of the machine. As a solution, he re-discovered the algorithm known as Prim's minimal spanning tree algorithm (known earlier to Jarník, and also rediscovered by Prim). + Dijkstra published the algorithm in 1959, two years after Prim and 29 years after Jarník. + + + **Algorithm** + + Let the node at which we are starting be called the initial node. Let the distance of node Y be the distance from the initial node to Y. Dijkstra's algorithm will assign some initial distance values and will try to improve them step by step. + +Assign to every node a tentative distance value: set it to zero for our initial node and to infinity for all other nodes. +Set the initial node as current. Mark all other nodes unvisited. Create a set of all the unvisited nodes called the unvisited set. +For the current node, consider all of its unvisited neighbors and calculate their tentative distances. Compare the newly calculated tentative distance to the current assigned value and assign the smaller one. For example, if the current node A is marked with a distance of 6, and the edge connecting it with a neighbor B has length 2, then the distance to B (through A) will be 6 + 2 = 8. If B was previously marked with a distance greater than 8 then change it to 8. Otherwise, keep the current value. +When we are done considering all of the neighbors of the current node, mark the current node as visited and remove it from the unvisited set. A visited node will never be checked again. +If the destination node has been marked visited (when planning a route between two specific nodes) or if the smallest tentative distance among the nodes in the unvisited set is infinity (when planning a complete traversal; occurs when there is no connection between the initial node and remaining unvisited nodes), then stop. The algorithm has finished. +Otherwise, select the unvisited node that is marked with the smallest tentative distance, set it as the new "current node", and go back to step 3. + +![](https://upload.wikimedia.org/wikipedia/commons/5/57/Dijkstra_Animation.gif) + +**A simple gif to demonstrate the algo** + + +--------------------------------------------------- + +##Related Problems +The functionality of Dijkstra's original algorithm can be extended with a variety of modifications. For example, sometimes it is desirable to present solutions which are less than mathematically optimal. To obtain a ranked list of less-than-optimal solutions, the optimal solution is first calculated. A single edge appearing in the optimal solution is removed from the graph, and the optimum solution to this new graph is calculated. Each edge of the original solution is suppressed in turn and a new shortest-path calculated. The secondary solutions are then ranked and presented after the first optimal solution. + +Dijkstra's algorithm is usually the working principle behind link-state routing protocols, OSPF and IS-IS being the most common ones. + +Unlike Dijkstra's algorithm, the Bellman–Ford algorithm can be used on graphs with negative edge weights, as long as the graph contains no negative cycle reachable from the source vertex s. The presence of such cycles means there is no shortest path, since the total weight becomes lower each time the cycle is traversed. It is possible to adapt Dijkstra's algorithm to handle negative weight edges by combining it with the Bellman-Ford algorithm (to remove negative edges and detect negative cycles), such an algorithm is called Johnson's algorithm. + +The A* algorithm is a generalization of Dijkstra's algorithm that cuts down on the size of the subgraph that must be explored, if additional information is available that provides a lower bound on the "distance" to the target. This approach can be viewed from the perspective of linear programming: there is a natural linear program for computing shortest paths, and solutions to its dual linear program are feasible if and only if they form a consistent heuristic (speaking roughly, since the sign conventions differ from place to place in the literature). This feasible dual / consistent heuristic defines a non-negative reduced cost and A* is essentially running Dijkstra's algorithm with these reduced costs. If the dual satisfies the weaker condition of admissibility, then A* is instead more akin to the Bellman–Ford algorithm. + +The process that underlies Dijkstra's algorithm is similar to the greedy process used in Prim's algorithm. Prim's purpose is to find a minimum spanning tree that connects all nodes in the graph; Dijkstra is concerned with only two nodes. Prim's does not evaluate the total weight of the path from the starting node, only the individual path. + +Breadth-first search can be viewed as a special-case of Dijkstra's algorithm on unweighted graphs, where the priority queue degenerates into a FIFO queue. + +Fast marching method can be viewed as a continuous version of Dijkstra's algorithm which computes the geodesic distance on a triangle mesh. + + +---------------------------------------------------------- + +##Applications + +1. **Flight Agenda** -- A travel agent requests software for making an agenda of flights for clients. The agent has access to a data base with all airports and flights. Besides the flight number, origin airport and destination, the flights have departure and arrival time. Specifically the agent wants to determine the earliest arrival time for the destination given an origin airport and start time + +2. **Telephone Network** -- In a telephone network the lines have bandwidth, BW. We want to route the phone call via the highest BW. + + + ---------------------------------------------- + **Source** + + [Wikipedia](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) + + [Dijkstra](http://www.csl.mtu.edu/cs2321/www/newLectures/30_More_Dijkstra.htm) From 8b5f426dc1f509440dd87007665aaa3e63c45db9 Mon Sep 17 00:00:00 2001 From: Prateek Chanda Date: Tue, 25 Oct 2016 11:47:25 +0530 Subject: [PATCH 11/32] Create rsa.c Adding solution for RSA algorithm --- Cryptography_Algorithm/RSA_Algorithm/rsa.c | 140 +++++++++++++++++++++ 1 file changed, 140 insertions(+) create mode 100644 Cryptography_Algorithm/RSA_Algorithm/rsa.c diff --git a/Cryptography_Algorithm/RSA_Algorithm/rsa.c b/Cryptography_Algorithm/RSA_Algorithm/rsa.c new file mode 100644 index 000000000..b19b520b8 --- /dev/null +++ b/Cryptography_Algorithm/RSA_Algorithm/rsa.c @@ -0,0 +1,140 @@ +#include +#include +#include +#include + +long int p,q,n,t,flag,e[100],d[100],temp[100],j,m[100],en[100],i; +char msg[100]; +int prime(long int); +void ce(); +long int cd(long int); +void encrypt(); +void decrypt(); +int main() +{ + printf("\nENTER FIRST PRIME NUMBER\n"); + scanf("%ld",&p); + flag=prime(p); + if(flag==0) + { + printf("\nWRONG INPUT\n"); + exit(1); + } + printf("\nENTER ANOTHER PRIME NUMBER\n"); + scanf("%ld",&q); + flag=prime(q); + if(flag==0||p==q) + { + printf("\nWRONG INPUT\n"); + exit(1); + } + printf("\nENTER MESSAGE\n"); + fflush(stdin); + scanf("%s",msg); + for(i=0;msg[i]!=NULL;i++) + m[i]=msg[i]; + n=p*q; + t=(p-1)*(q-1); + ce(); + printf("\nPOSSIBLE VALUES OF e AND d ARE\n"); + for(i=0;i0) + { + d[k]=flag; + k++; + } + if(k==99) + break; + } + } +} + +long int cd(long int x) +{ + long int k=1; + while(1) + { + k=k+t; + if(k%x==0) + return(k/x); + } +} + +void encrypt() +{ + long int pt,ct,key=e[0],k,len; + i=0; + len=strlen(msg); + while(i!=len) + { + pt=m[i]; + pt=pt-96; + k=1; + for(j=0;j Date: Sun, 25 Dec 2016 09:04:41 +0530 Subject: [PATCH 12/32] Deleting rsa.c --- Cryptography_Algorithm/RSA_Algorithm/rsa.c | 140 --------------------- 1 file changed, 140 deletions(-) delete mode 100644 Cryptography_Algorithm/RSA_Algorithm/rsa.c diff --git a/Cryptography_Algorithm/RSA_Algorithm/rsa.c b/Cryptography_Algorithm/RSA_Algorithm/rsa.c deleted file mode 100644 index b19b520b8..000000000 --- a/Cryptography_Algorithm/RSA_Algorithm/rsa.c +++ /dev/null @@ -1,140 +0,0 @@ -#include -#include -#include -#include - -long int p,q,n,t,flag,e[100],d[100],temp[100],j,m[100],en[100],i; -char msg[100]; -int prime(long int); -void ce(); -long int cd(long int); -void encrypt(); -void decrypt(); -int main() -{ - printf("\nENTER FIRST PRIME NUMBER\n"); - scanf("%ld",&p); - flag=prime(p); - if(flag==0) - { - printf("\nWRONG INPUT\n"); - exit(1); - } - printf("\nENTER ANOTHER PRIME NUMBER\n"); - scanf("%ld",&q); - flag=prime(q); - if(flag==0||p==q) - { - printf("\nWRONG INPUT\n"); - exit(1); - } - printf("\nENTER MESSAGE\n"); - fflush(stdin); - scanf("%s",msg); - for(i=0;msg[i]!=NULL;i++) - m[i]=msg[i]; - n=p*q; - t=(p-1)*(q-1); - ce(); - printf("\nPOSSIBLE VALUES OF e AND d ARE\n"); - for(i=0;i0) - { - d[k]=flag; - k++; - } - if(k==99) - break; - } - } -} - -long int cd(long int x) -{ - long int k=1; - while(1) - { - k=k+t; - if(k%x==0) - return(k/x); - } -} - -void encrypt() -{ - long int pt,ct,key=e[0],k,len; - i=0; - len=strlen(msg); - while(i!=len) - { - pt=m[i]; - pt=pt-96; - k=1; - for(j=0;j Date: Sun, 25 Dec 2016 09:09:41 +0530 Subject: [PATCH 13/32] Create rsa.py RSA algorithm implemented in python --- Cryptography/RSA_Algorithm/rsa.py | 116 ++++++++++++++++++++++++++++++ 1 file changed, 116 insertions(+) create mode 100644 Cryptography/RSA_Algorithm/rsa.py diff --git a/Cryptography/RSA_Algorithm/rsa.py b/Cryptography/RSA_Algorithm/rsa.py new file mode 100644 index 000000000..d4d764752 --- /dev/null +++ b/Cryptography/RSA_Algorithm/rsa.py @@ -0,0 +1,116 @@ +import random + + +''' +Euclid's algorithm for determining the greatest common divisor +Use iteration to make it faster for larger integers +''' +def gcd(a, b): + while b != 0: + a, b = b, a % b + return a + +''' +Euclid's extended algorithm for finding the multiplicative inverse of two numbers +''' +def multiplicative_inverse(e, phi): + d = 0 + x1 = 0 + x2 = 1 + y1 = 1 + temp_phi = phi + + while e > 0: + temp1 = temp_phi/e + temp2 = temp_phi - temp1 * e + temp_phi = e + e = temp2 + + x = x2- temp1* x1 + y = d - temp1 * y1 + + x2 = x1 + x1 = x + d = y1 + y1 = y + + if temp_phi == 1: + return d + phi + +''' +Tests to see if a number is prime. +''' +def is_prime(num): + if num == 2: + return True + if num < 2 or num % 2 == 0: + return False + for n in xrange(3, int(num**0.5)+2, 2): + if num % n == 0: + return False + return True + +def generate_keypair(p, q): + if not (is_prime(p) and is_prime(q)): + raise ValueError('Both numbers must be prime.') + elif p == q: + raise ValueError('p and q cannot be equal') + #n = pq + n = p * q + + #Phi is the totient of n + # n number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. + phi = (p-1) * (q-1) + + #Choose an integer e such that e and phi(n) are coprime + e = random.randrange(1, phi) + + #Use Euclid's Algorithm to verify that e and phi(n) are comprime + + g = gcd(e, phi) + while g != 1: + e = random.randrange(1, phi) + g = gcd(e, phi) + + #Use Extended Euclid's Algorithm to generate the private key + + d = multiplicative_inverse(e, phi) + + #Return public and private keypair + #Public key is (e, n) and private key is (d, n) + return ((e, n), (d, n)) + +def encrypt(pk, plaintext): + #Unpack the key into it's components + key, n = pk + #Convert each letter in the plaintext to numbers based on the character using a^b mod m + cipher = [(ord(char) ** key) % n for char in plaintext] + #Return the array of bytes + return cipher + +def decrypt(pk, ciphertext): + #Unpack the key into its components + key, n = pk + #Generate the plaintext based on the ciphertext and key using a^b mod m + plain = [chr((char ** key) % n) for char in ciphertext] + #Return the array of bytes as a string + return ''.join(plain) + + +if __name__ == '__main__': + ''' + Detect if the script is being run directly by the user + ''' + print "RSA Encrypter/ Decrypter" + p = int(raw_input("Enter a prime number (17, 19, 23, etc): ")) + q = int(raw_input("Enter another prime number (Not one you entered above): ")) + print "Generating your public/private keypairs now . . ." + public, private = generate_keypair(p, q) + print "Your public key is ", public ," and your private key is ", private + message = raw_input("Enter a message to encrypt with your private key: ") + encrypted_msg = encrypt(private, message) + print "Your encrypted message is: " + print ''.join(map(lambda x: str(x), encrypted_msg)) + print "Decrypting message with public key ", public ," . . ." + print "Your message is:" + print decrypt(public, encrypted_msg) From d01ab81da9a5f8b38a46d1d96235e5d3589c258e Mon Sep 17 00:00:00 2001 From: Prateek Chanda Date: Sun, 25 Dec 2016 09:14:17 +0530 Subject: [PATCH 14/32] Create rsa.py RSA Algorithm implemented in python --- Cryptography/RSA_Algortihm/rsa.py | 113 ++++++++++++++++++++++++++++++ 1 file changed, 113 insertions(+) create mode 100644 Cryptography/RSA_Algortihm/rsa.py diff --git a/Cryptography/RSA_Algortihm/rsa.py b/Cryptography/RSA_Algortihm/rsa.py new file mode 100644 index 000000000..3199e6bfc --- /dev/null +++ b/Cryptography/RSA_Algortihm/rsa.py @@ -0,0 +1,113 @@ +import random + + +''' +Euclid's algorithm for determining the greatest common divisor +Use iteration to make it faster for larger integers +''' +def gcd(a, b): + while b != 0: + a, b = b, a % b + return a + +''' +Euclid's extended algorithm for finding the multiplicative inverse of two numbers +''' +def multiplicative_inverse(e, phi): + d = 0 + x1 = 0 + x2 = 1 + y1 = 1 + temp_phi = phi + + while e > 0: + temp1 = temp_phi/e + temp2 = temp_phi - temp1 * e + temp_phi = e + e = temp2 + + x = x2- temp1* x1 + y = d - temp1 * y1 + + x2 = x1 + x1 = x + d = y1 + y1 = y + + if temp_phi == 1: + return d + phi + +''' +Tests to see if a number is prime. +''' +def is_prime(num): + if num == 2: + return True + if num < 2 or num % 2 == 0: + return False + for n in xrange(3, int(num**0.5)+2, 2): + if num % n == 0: + return False + return True + +def generate_keypair(p, q): + if not (is_prime(p) and is_prime(q)): + raise ValueError('Both numbers must be prime.') + elif p == q: + raise ValueError('p and q cannot be equal') + #n = pq + n = p * q + + #Phi is the totient of n + phi = (p-1) * (q-1) + + #Choose an integer e such that e and phi(n) are coprime + e = random.randrange(1, phi) + + #Use Euclid's Algorithm to verify that e and phi(n) are comprime + g = gcd(e, phi) + while g != 1: + e = random.randrange(1, phi) + g = gcd(e, phi) + + #Use Extended Euclid's Algorithm to generate the private key + d = multiplicative_inverse(e, phi) + + #Return public and private keypair + #Public key is (e, n) and private key is (d, n) + return ((e, n), (d, n)) + +def encrypt(pk, plaintext): + #Unpack the key into it's components + key, n = pk + #Convert each letter in the plaintext to numbers based on the character using a^b mod m + cipher = [(ord(char) ** key) % n for char in plaintext] + #Return the array of bytes + return cipher + +def decrypt(pk, ciphertext): + #Unpack the key into its components + key, n = pk + #Generate the plaintext based on the ciphertext and key using a^b mod m + plain = [chr((char ** key) % n) for char in ciphertext] + #Return the array of bytes as a string + return ''.join(plain) + + +if __name__ == '__main__': + ''' + Detect if the script is being run directly by the user + ''' + print "RSA Encrypter/ Decrypter" + p = int(raw_input("Enter a prime number (17, 19, 23, etc): ")) + q = int(raw_input("Enter another prime number (Not one you entered above): ")) + print "Generating your public/private keypairs now . . ." + public, private = generate_keypair(p, q) + print "Your public key is ", public ," and your private key is ", private + message = raw_input("Enter a message to encrypt with your private key: ") + encrypted_msg = encrypt(private, message) + print "Your encrypted message is: " + print ''.join(map(lambda x: str(x), encrypted_msg)) + print "Decrypting message with public key ", public ," . . ." + print "Your message is:" + print decrypt(public, encrypted_msg) From 4924f1259f12639419a3f82453140d95537f7c7a Mon Sep 17 00:00:00 2001 From: Prateek Chanda Date: Sun, 25 Dec 2016 09:26:56 +0530 Subject: [PATCH 15/32] Update README.md --- README.md | 164 ++++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 164 insertions(+) diff --git a/README.md b/README.md index ea36f3961..f58a3ac6b 100644 --- a/README.md +++ b/README.md @@ -4,3 +4,167 @@ A Repository to store implementation of some of the famous Data Structures and A
[![Join the chat at https://gitter.im/codeIIEST/Algorithms](https://badges.gitter.im/codeIIEST/Algorithms.svg)](https://gitter.im/codeIIEST/Algorithms?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) + + + + +## Sort Algorithms + + +### Bubble +![alt text][bubble-image] + +From [Wikipedia][bubble-wiki]: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. + +__Properties__ +* Worst case performance O(n^2) +* Best case performance O(n) +* Average case performance O(n^2) + +###### View the algorithm in [action][bubble-toptal] + + + +### Insertion +![alt text][insertion-image] + +From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. + +__Properties__ +* Worst case performance O(n^2) +* Best case performance O(n) +* Average case performance O(n^2) + +###### View the algorithm in [action][insertion-toptal] + + +### Merge +![alt text][merge-image] + +From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. + +__Properties__ +* Worst case performance O(n log n) +* Best case performance O(n) +* Average case performance O(n) + + +###### View the algorithm in [action][merge-toptal] + +### Quick +![alt text][quick-image] + +From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. + +__Properties__ +* Worst case performance O(n^2) +* Best case performance O(n log n) or O(n) with three-way partition +* Average case performance O(n^2) + +###### View the algorithm in [action][quick-toptal] + +### Selection +![alt text][selection-image] + +From [Wikipedia][selection-wiki]: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right. + +__Properties__ +* Worst case performance O(n^2) +* Best case performance O(n^2) +* Average case performance O(n^2) + +###### View the algorithm in [action][selection-toptal] + +### Shell +![alt text][shell-image] + +From [Wikipedia][shell-wiki]: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywherem considereing every nth element gives a sorted list. Such a list is said to be h-sorted. Equivanelty, it can be thought of as h intterleaved lists, each individually sorted. + +__Properties__ +* Worst case performance O(nlog2 2n) +* Best case performance O(n log n) +* Average case performance depends on gap sequence + +###### View the algorithm in [action][shell-toptal] + +###Time-Compexity Graphs + +Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort) + +[Complexity Graphs](https://github.com/prateekiiest/Python/blob/master/sorts/sortinggraphs.png) + +---------------------------------------------------------------------------------- + +## Search Algorithms + +### Linear +![alt text][linear-image] + +From [Wikipedia][linear-wiki]: linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. + Linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. + +__Properties__ +* Worst case performance O(n) +* Best case performance O(1) +* Average case performance O(n) +* Worst case space complexity O(1) iterative + +### Binary +![alt text][binary-image] + +From [Wikipedia][binary-wiki]: Binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful. + +__Properties__ +* Worst case performance O(log n) +* Best case performance O(1) +* Average case performance O(log n) +* Worst case space complexity O(1) + +---------------------------------------------------------------------------------------------------------------------- + +## Ciphers + +### Caesar +![alt text][caesar]
+In cryptography, a **Caesar cipher**, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques.
+It is **a type of substitution cipher** in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on.
+The method is named after **Julius Caesar**, who used it in his private correspondence.
+The encryption step performed by a Caesar cipher is often incorporated as part of more complex schemes, such as the Vigenère cipher, and still has modern application in the ROT13 system. As with all single-alphabet substitution ciphers, the Caesar cipher is easily broken and in modern practice offers essentially no communication security. +###### Source: [Wikipedia](https://en.wikipedia.org/wiki/Caesar_cipher) + + + + + +[bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort +[bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort +[bubble-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/8/83/Bubblesort-edited-color.svg/220px-Bubblesort-edited-color.svg.png "Bubble Sort" + +[insertion-toptal]: https://www.toptal.com/developers/sorting-algorithms/insertion-sort +[insertion-wiki]: https://en.wikipedia.org/wiki/Insertion_sort +[insertion-image]: https://upload.wikimedia.org/wikipedia/commons/7/7e/Insertionsort-edited.png "Insertion Sort" + +[quick-toptal]: https://www.toptal.com/developers/sorting-algorithms/quick-sort +[quick-wiki]: https://en.wikipedia.org/wiki/Quicksort +[quick-image]: https://upload.wikimedia.org/wikipedia/commons/6/6a/Sorting_quicksort_anim.gif "Quick Sort" + +[merge-toptal]: https://www.toptal.com/developers/sorting-algorithms/merge-sort +[merge-wiki]: https://en.wikipedia.org/wiki/Merge_sort +[merge-image]: https://upload.wikimedia.org/wikipedia/commons/c/cc/Merge-sort-example-300px.gif "Merge Sort" + +[selection-toptal]: https://www.toptal.com/developers/sorting-algorithms/selection-sort +[selection-wiki]: https://en.wikipedia.org/wiki/Selection_sort +[selection-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/b/b0/Selection_sort_animation.gif/250px-Selection_sort_animation.gif "Selection Sort Sort" + +[shell-toptal]: https://www.toptal.com/developers/sorting-algorithms/shell-sort +[shell-wiki]: https://en.wikipedia.org/wiki/Shellsort +[shell-image]: https://upload.wikimedia.org/wikipedia/commons/d/d8/Sorting_shellsort_anim.gif "Shell Sort" + +[linear-wiki]: https://en.wikipedia.org/wiki/Linear_search +[linear-image]: http://www.tutorialspoint.com/data_structures_algorithms/images/linear_search.gif + +[binary-wiki]: https://en.wikipedia.org/wiki/Binary_search_algorithm +[binary-image]: https://upload.wikimedia.org/wikipedia/commons/f/f7/Binary_search_into_array.png + + +[caesar]: https://upload.wikimedia.org/wikipedia/commons/4/4a/Caesar_cipher_left_shift_of_3.svg From ca5366079693ba3f9d83226948ea05100408f252 Mon Sep 17 00:00:00 2001 From: smitbose Date: Sun, 25 Dec 2016 18:52:19 +0530 Subject: [PATCH 16/32] Created clean working tree --- Cryptography/RSA_Algorithm/rsa.py | 116 --------- Cryptography/RSA_Algortihm/rsa.py | 113 --------- Longest_Common_Subsequence/lcs.cpp | 73 ------ Longest_Increasing_Subsequence/a.out | Bin 13600 -> 0 bytes .../lis_n_log_n.cpp | 67 ----- .../lis_n_squared_sol.cpp | 73 ------ Minimum_Spanning_Tree/KruskalMST.cpp | 107 -------- Minimum_Spanning_Tree/Prims.cpp | 225 ----------------- Minimum_Spanning_Tree/a.out | Bin 53424 -> 0 bytes README.md | 170 ------------- Shortest_Path/Floyd-Warshall/a.out | Bin 13584 -> 0 bytes .../Floyd-Warshall/floyd_warshall.cpp | 57 ----- Shortest_Path/dijsktra/READMEDijkstra.md | 62 ----- Shortest_Path/dijsktra/a.out | Bin 33192 -> 0 bytes .../dijsktra/dijsktra_implementation.cpp | 230 ------------------ binaryIndexedTree/Reference.txt | 3 - binaryIndexedTree/SPOJ_ctrick.cpp | 116 --------- binaryIndexedTree/SPOJ_invcnt.cpp | 78 ------ binaryIndexedTree/binary_indexed_tree.cpp | 76 ------ .../SPOJ_horrible.cpp | 76 ------ editDistance/CODECHEF_seatsr.cpp | 78 ------ editDistance/SPOJ_edist.cpp | 42 ---- editDistance/a.out | Bin 13600 -> 0 bytes 23 files changed, 1762 deletions(-) delete mode 100644 Cryptography/RSA_Algorithm/rsa.py delete mode 100644 Cryptography/RSA_Algortihm/rsa.py delete mode 100644 Longest_Common_Subsequence/lcs.cpp delete mode 100755 Longest_Increasing_Subsequence/a.out delete mode 100644 Longest_Increasing_Subsequence/lis_n_log_n.cpp delete mode 100644 Longest_Increasing_Subsequence/lis_n_squared_sol.cpp delete mode 100644 Minimum_Spanning_Tree/KruskalMST.cpp delete mode 100644 Minimum_Spanning_Tree/Prims.cpp delete mode 100755 Minimum_Spanning_Tree/a.out delete mode 100644 README.md delete mode 100755 Shortest_Path/Floyd-Warshall/a.out delete mode 100644 Shortest_Path/Floyd-Warshall/floyd_warshall.cpp delete mode 100644 Shortest_Path/dijsktra/READMEDijkstra.md delete mode 100755 Shortest_Path/dijsktra/a.out delete mode 100644 Shortest_Path/dijsktra/dijsktra_implementation.cpp delete mode 100644 binaryIndexedTree/Reference.txt delete mode 100644 binaryIndexedTree/SPOJ_ctrick.cpp delete mode 100644 binaryIndexedTree/SPOJ_invcnt.cpp delete mode 100644 binaryIndexedTree/binary_indexed_tree.cpp delete mode 100644 binaryIndexedTree/range_query_range_update/SPOJ_horrible.cpp delete mode 100644 editDistance/CODECHEF_seatsr.cpp delete mode 100644 editDistance/SPOJ_edist.cpp delete mode 100755 editDistance/a.out diff --git a/Cryptography/RSA_Algorithm/rsa.py b/Cryptography/RSA_Algorithm/rsa.py deleted file mode 100644 index d4d764752..000000000 --- a/Cryptography/RSA_Algorithm/rsa.py +++ /dev/null @@ -1,116 +0,0 @@ -import random - - -''' -Euclid's algorithm for determining the greatest common divisor -Use iteration to make it faster for larger integers -''' -def gcd(a, b): - while b != 0: - a, b = b, a % b - return a - -''' -Euclid's extended algorithm for finding the multiplicative inverse of two numbers -''' -def multiplicative_inverse(e, phi): - d = 0 - x1 = 0 - x2 = 1 - y1 = 1 - temp_phi = phi - - while e > 0: - temp1 = temp_phi/e - temp2 = temp_phi - temp1 * e - temp_phi = e - e = temp2 - - x = x2- temp1* x1 - y = d - temp1 * y1 - - x2 = x1 - x1 = x - d = y1 - y1 = y - - if temp_phi == 1: - return d + phi - -''' -Tests to see if a number is prime. -''' -def is_prime(num): - if num == 2: - return True - if num < 2 or num % 2 == 0: - return False - for n in xrange(3, int(num**0.5)+2, 2): - if num % n == 0: - return False - return True - -def generate_keypair(p, q): - if not (is_prime(p) and is_prime(q)): - raise ValueError('Both numbers must be prime.') - elif p == q: - raise ValueError('p and q cannot be equal') - #n = pq - n = p * q - - #Phi is the totient of n - # n number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. - phi = (p-1) * (q-1) - - #Choose an integer e such that e and phi(n) are coprime - e = random.randrange(1, phi) - - #Use Euclid's Algorithm to verify that e and phi(n) are comprime - - g = gcd(e, phi) - while g != 1: - e = random.randrange(1, phi) - g = gcd(e, phi) - - #Use Extended Euclid's Algorithm to generate the private key - - d = multiplicative_inverse(e, phi) - - #Return public and private keypair - #Public key is (e, n) and private key is (d, n) - return ((e, n), (d, n)) - -def encrypt(pk, plaintext): - #Unpack the key into it's components - key, n = pk - #Convert each letter in the plaintext to numbers based on the character using a^b mod m - cipher = [(ord(char) ** key) % n for char in plaintext] - #Return the array of bytes - return cipher - -def decrypt(pk, ciphertext): - #Unpack the key into its components - key, n = pk - #Generate the plaintext based on the ciphertext and key using a^b mod m - plain = [chr((char ** key) % n) for char in ciphertext] - #Return the array of bytes as a string - return ''.join(plain) - - -if __name__ == '__main__': - ''' - Detect if the script is being run directly by the user - ''' - print "RSA Encrypter/ Decrypter" - p = int(raw_input("Enter a prime number (17, 19, 23, etc): ")) - q = int(raw_input("Enter another prime number (Not one you entered above): ")) - print "Generating your public/private keypairs now . . ." - public, private = generate_keypair(p, q) - print "Your public key is ", public ," and your private key is ", private - message = raw_input("Enter a message to encrypt with your private key: ") - encrypted_msg = encrypt(private, message) - print "Your encrypted message is: " - print ''.join(map(lambda x: str(x), encrypted_msg)) - print "Decrypting message with public key ", public ," . . ." - print "Your message is:" - print decrypt(public, encrypted_msg) diff --git a/Cryptography/RSA_Algortihm/rsa.py b/Cryptography/RSA_Algortihm/rsa.py deleted file mode 100644 index 3199e6bfc..000000000 --- a/Cryptography/RSA_Algortihm/rsa.py +++ /dev/null @@ -1,113 +0,0 @@ -import random - - -''' -Euclid's algorithm for determining the greatest common divisor -Use iteration to make it faster for larger integers -''' -def gcd(a, b): - while b != 0: - a, b = b, a % b - return a - -''' -Euclid's extended algorithm for finding the multiplicative inverse of two numbers -''' -def multiplicative_inverse(e, phi): - d = 0 - x1 = 0 - x2 = 1 - y1 = 1 - temp_phi = phi - - while e > 0: - temp1 = temp_phi/e - temp2 = temp_phi - temp1 * e - temp_phi = e - e = temp2 - - x = x2- temp1* x1 - y = d - temp1 * y1 - - x2 = x1 - x1 = x - d = y1 - y1 = y - - if temp_phi == 1: - return d + phi - -''' -Tests to see if a number is prime. -''' -def is_prime(num): - if num == 2: - return True - if num < 2 or num % 2 == 0: - return False - for n in xrange(3, int(num**0.5)+2, 2): - if num % n == 0: - return False - return True - -def generate_keypair(p, q): - if not (is_prime(p) and is_prime(q)): - raise ValueError('Both numbers must be prime.') - elif p == q: - raise ValueError('p and q cannot be equal') - #n = pq - n = p * q - - #Phi is the totient of n - phi = (p-1) * (q-1) - - #Choose an integer e such that e and phi(n) are coprime - e = random.randrange(1, phi) - - #Use Euclid's Algorithm to verify that e and phi(n) are comprime - g = gcd(e, phi) - while g != 1: - e = random.randrange(1, phi) - g = gcd(e, phi) - - #Use Extended Euclid's Algorithm to generate the private key - d = multiplicative_inverse(e, phi) - - #Return public and private keypair - #Public key is (e, n) and private key is (d, n) - return ((e, n), (d, n)) - -def encrypt(pk, plaintext): - #Unpack the key into it's components - key, n = pk - #Convert each letter in the plaintext to numbers based on the character using a^b mod m - cipher = [(ord(char) ** key) % n for char in plaintext] - #Return the array of bytes - return cipher - -def decrypt(pk, ciphertext): - #Unpack the key into its components - key, n = pk - #Generate the plaintext based on the ciphertext and key using a^b mod m - plain = [chr((char ** key) % n) for char in ciphertext] - #Return the array of bytes as a string - return ''.join(plain) - - -if __name__ == '__main__': - ''' - Detect if the script is being run directly by the user - ''' - print "RSA Encrypter/ Decrypter" - p = int(raw_input("Enter a prime number (17, 19, 23, etc): ")) - q = int(raw_input("Enter another prime number (Not one you entered above): ")) - print "Generating your public/private keypairs now . . ." - public, private = generate_keypair(p, q) - print "Your public key is ", public ," and your private key is ", private - message = raw_input("Enter a message to encrypt with your private key: ") - encrypted_msg = encrypt(private, message) - print "Your encrypted message is: " - print ''.join(map(lambda x: str(x), encrypted_msg)) - print "Decrypting message with public key ", public ," . . ." - print "Your message is:" - print decrypt(public, encrypted_msg) diff --git a/Longest_Common_Subsequence/lcs.cpp b/Longest_Common_Subsequence/lcs.cpp deleted file mode 100644 index e931be526..000000000 --- a/Longest_Common_Subsequence/lcs.cpp +++ /dev/null @@ -1,73 +0,0 @@ - -#include -using namespace std; -#define lli long long int -#define infinite 0xffff -#define Min(a,b) (((a)<(b))?(a):(b)) -#define Max(a,b) (((a)>(b))?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s , i--) -void lcs(char * a, char *b) -{ - lli lena,lenb,i,j,count; - lena=strlen(a); - lenb=strlen(b); - char record[lena+1][lenb+1]; - //Code to generate the map - fr(i,0,lena+1) - { - fr(j,0,lenb+1) - { - if(i==0 || j==0) - { - record[i][j]=0; - } - else if(a[i-1]==b[j-1]) - { - record[i][j]=record[i-1][j-1]+1; - } - else - { - record[i][j] = Max(record[i-1][j],record[i][j-1]); - } - } - } - //Code to find the subsequence - i = lena; - j = lenb; - char sub[record[lena][lenb]]; - lli index = record[i][j]-1; - while( i > 0 && j > 0 ) - { - if(a[i-1]==b[j-1]) - { - sub[index]=a[i-1]; - i--; - j--; - index--; - } - else if(Max(record[i-1][j],record[i][j-1]) == record[i-1][j]) - { - i--; - } - else - { - j--; - } - } - fr(i,0,record[lena][lenb]) - { - cout<>str1; - cin>>str2; - lcs(str1,str2); - return 0; -} \ No newline at end of file diff --git a/Longest_Increasing_Subsequence/a.out b/Longest_Increasing_Subsequence/a.out deleted file mode 100755 index 4f7b1a9728c0681ce1f6577a88fd744877929a8b..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 13600 zcmeHOeQ;Y>mA{f4+f7|rDJeM3woyY1NsCp>ae~wAwvrtsPsK@$KT0Xe@ z=_xqf4Y(`XMYt{*K01LJhQJI=fj=<+Fex92l0f4!omscDuwm)$c$n?3+!RPZ=(^pu z-ru?J9{K56>ULmuX8-W@Je_-f_ndR@J@0WSI)#l>q5cTbFK-Ea^Ipb+5HCxWs}&CUU1ar zjkstGPLJj;1@C{;RrTW?A);`wsRSor!c-ABkk+9pO~M*y|4+6*};AG8^jM*Vmu!*FzFWWU`^Y zNo4ztj(94T3`hG7zdt$_$>>HVk}$I2XeiVNYzK@bqIx=OWa5$W@PIzhric1>q2a5m z>o%+FH+Do5DQP>I4Zl0P(E(W9srP;)YPKnw&Ka@_YWXDjFv{+O=b}gS=-3f`G?GZd zpV7&P9x>vR325jfshm3=K`Zw6guA-+c3($1*Y4YC=I^~%-vL}DCuSwhJ({m|__h9# zhyzFn_mt*S8?KFs1g2@7__V@u*C(!`nO#u#-2n~Ck~}42`xmf8I>nb&`O=nQiPPGp zAj$JMq_v*b0Zu%w2xpsA)}qF31M*foUJFkB;hTd6)r9;Bi*u|cyi(5yyTt4({NZUO8$-afp-x=ko>d6)3&)dEcss$PcB>RmHc_)$yJL1 z@c!S03(wrI6@IJb|NTnuK=@*@7dxbO@!Y~SL@pj~3W(Bv2);Vnyk)Ntr~d(t8q`{8 zJZbqQw^n%m=;qU~Cf&1P=qwd1FF^P+1d5>xu%XbHVUDVzo-?^q6?6n)$%0=Fw}Kk%b$0I3(p3BEbC%^KKO*> z^F@btZo#F^^fsKPIV=?&^G{IzM^fUyUeb;fJ=*r4k@bAB0q%B56*Li5oz|v3)HPx)_||ujD0mis@J=@7v>9z#He*YarY<)NyA)GpYZFl`o|(F!kX7oWu4U)Bm2ORv906gRV4 zm$(kx3Ry?dvG~f{kSBwMC(qKNS^E1omzU4bHcr+a0z)oC|4b+C3C$gEg*>&ih&znC zsPyh8y%nXg@Q+RDJEG%z)PRn0#XuB`xUZ4%- z6GPmK3nx~peB}ZL6zxH3%c185FWTnV?Ak+T7FyUpi%L#`YUsoS=$&xp9Ox6ECD3II zb$V`WL3aY6_ka$APJ&K>mO$mChb)~VC^;VJ6OKubV{=nO;|WKDhj2PO&ZDkdNkFCQ z@x(4o_Uv=F+}(WjCmW~4UDxlqb;r$H2__kADpKE%k`H|DMM->!u1HQ|HN?Fgg%w!4t(DAXx+@ZN9ywpt_DY0 zp6dMxu6g+8PSCRaF;j%fpTqTglwW5p?={P*&2Qqmg7P?(cey>EcXqj39(9G>-kG{C z_qIpYY3{a%>os?0zTuENFyZbDy4!;8ZC!3J0 zYaUqhz?uivJh0}0H4m(LV9f(-9{B(5fvKwkvVmvt+LY3;;w6J0I+9YdQ+oGLsmUZ_ zz9ArU{EmLWZStE`Ie%ZJ*U*&c9UrCZO(Gic`jZl!Un$`TEz=+0UQScyq%%OI{LOc) z&gA)9=e*P8=>;*RZ>aY1JMMlC=4ySwl3ZW|oQrHq_+r?1`TZ*6bSNw$5v33%Jv{5$<^ z{x(q|+~M2pYj5?pnZkbmcCSQ)@MVvU8<7!EBV*Dr&LvX#zBnO#sk9OI1-rtnM&z*K z4ySUykz4{Fv=cGmBW^5`9TUFTu@vl?)X116N8_1nBAu#Wbd+V{$p|T^+(gn4z63r% z3Ln19;dc}a%F?lj5fQ%lm_C|`jK}q{7<8F4HS|a(6FFvTaQ<(i5QFu|cp{3b(=do1 zpRC2SIFii@Uo<^F9#0t-AJ@vdFuOaQfmOvW%!YxgxJwvS@w)OnwHk9_*7E$U#Ov|J zC}4$T-X$7Dwej!5s=)Kcs^r4kM4o?@`1iL^$ER48T;e_D^|BJ*DCjeiJ-M*zRh!=~@m|5- zU9CDUfmKeehn0AXn5c@c#0yl)^Xk5W(z047UZRgO6{!iF18)`W?Wg_2i7&qkwspg& zaIbB@3M$;bk9|zq-y~+Y4kNd+pN-1=YJbiEr+RsRBppg$!R0{21Mg=N#LsD5)%rCj zWlxFvPwAg=N&9NwmG5$aH9&xH-j8{|BE4$%TT$S^_|ZH8NUS7^2dU;ylBi~9 zzm#8n--oDT^q2Q%;wYsQZui53($4Df_Br5Qv3mT__y20~Cf@^oE&M=Vbt&=w_+y20 zT-vR&REYBmziE9yBJ!O(a!&*IN~H4VH#P7-NIR?N^&cf(X@j`y(J+dCv8UZN@P38c z<7Fm+d+kQRf2oF@UjyHO=qFxh>XdG&h8-s!bUao3-wb?%v!xvG!%f&sc$N5_b|p{W zp{(gH;B>#}^E)N^Z2|Ouu+u&I88-0qjrrUv2e<{v@lKgf9+9B~O`%5%qWR2YDs1G4M`rX}q zdQZ5201;0sflazGu16`fDJwXl$pYzmEUh0-rbi-4J!YgcSv``Q6xie^l5ry*^L=>d zu1;94BBayfhWYTIW>J?14&dL=Wrw zeTb+^q#~JPdQUoiWN@N)5(#bE*B3kx(nAOLQcRe1m&z;sL;LpihY)=g?CJ@TL`Az} zm4J*b6Z+nd9}FG{cMEz%GDD(dXDB!;5Rh?EDgsJHO+~Xg={Zpr-T`Nzfw2C+$E?Xm zyc$7aRjV^2;3!B-6(dTEVzaCPUAB_dA!iifX0!fI!E*?A`x8Ra>=hh>gJOx4p3BDJ zd8&_xZ)K>SZuPv5GQPhQbw?3yHp6->o7TrLiYU&{jAWyGqQ+f~frCe1zF$Nwp>ZqD z>sSe;vsH=Mzj7G|2--y8bTeAej{m8lgEl*H`3NtA^~|oy<>k-*p>sF3u<}02&-)yA z&F5~eh-9tl{b1;+^YJUI8anhv|I+Wm&%kc}n--!WL21=W~mUcmvMw z8<3UB?!Wti(pjJD=kv{a^#Wt7(p#q}%P~CyoZcNU&*z{vrQfUch$R_rzk8#mCb`xAp{L5_qdVKR?c@hJKSBZ_`t(_^M5x&wT@KQ-a^~u)Mwf zr<6YXpP$=?l|K8Wmj2^5eLhF>{|5}PqN4Wte`wR^^JY=i|A=kC^8I78MPx{n<^Uyr z?&tp(U_YCsEBBxIr;%yK#rk}nXjK1CVXx25UxF?*k@fkU=y{j={|a65G3)brxJBtN zsQ&YP;QF~=|6!}2&&^9)P=LhpCbz;fei;SU_LtAsUQ=U&6%}PYrmq6G>hn2#!fPsU zJC*vX_Pl`tvc>)9=h-Q*sloez$qAugW(6JCss6SyVrE#s&xVsMC8isY=elKq`gzuC vW_bPJGS;*5Ja-r)x^R=pO{sO@2C&pd_8YH1G(W4=KfK-4zr!|R?DhW-a8kfV diff --git a/Longest_Increasing_Subsequence/lis_n_log_n.cpp b/Longest_Increasing_Subsequence/lis_n_log_n.cpp deleted file mode 100644 index 931ddcb1a..000000000 --- a/Longest_Increasing_Subsequence/lis_n_log_n.cpp +++ /dev/null @@ -1,67 +0,0 @@ -#include -using namespace std; -#define lli long long int -#define infinite 0xffff -#define Min(a,b) (((a)<(b))?(a):(b)) -#define Max(a,b) (((a)>(b))?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s ; i--) -lli binary_LookUp(lli * record ,lli a , lli len , lli val) -{ - while(len-a > 1) - { - lli m = a + (len-a)/2; - if(record[m]>=val) - { - len = m ; - } - else - { - a = m ; - } - } - return len ; -} -void lis(lli * a, lli n) -{ - lli i,j,count,index; - lli record[n]; - //Code to generate the map - record[0]=a[0]; - lli len = 1 ; - fr(i,1,n) - { - if(a[i] record[len-1]) - { - record[len] = a[i]; - len++; - } - else - { - index=binary_LookUp(record,-1,len-1,a[i]); - record[index] = a[i]; - } - } - cout<>n; - lli a[n]; - fr(i,0,n) - { - cin>>a[i]; - } - lis(a,n); - return 0; -} \ No newline at end of file diff --git a/Longest_Increasing_Subsequence/lis_n_squared_sol.cpp b/Longest_Increasing_Subsequence/lis_n_squared_sol.cpp deleted file mode 100644 index 471a6aa33..000000000 --- a/Longest_Increasing_Subsequence/lis_n_squared_sol.cpp +++ /dev/null @@ -1,73 +0,0 @@ -#include -using namespace std; -#define lli long long int -#define infinite 0xffff -#define Min(a,b) (((a)<(b))?(a):(b)) -#define Max(a,b) (((a)>(b))?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s ; i--) -void lis(lli * a, lli n) -{ - lli i,j,count; - lli record[n]; - //Code to generate the map - fr(i,0,n) - { - record[i] = 0 ; - } - fr(i,0,n) - { - fr(j,0,i) - { - if( (a[i]>a[j]) && (record[i]<(record[j]+1)) ) - { - record[i]=record[j]+1; - } - } - } - lli max = 0; - lli index = 0 ; - fr(i,0,n) - { - //cout<>n; - lli a[n]; - fr(i,0,n) - { - cin>>a[i]; - } - lis(a,n); - return 0; -} \ No newline at end of file diff --git a/Minimum_Spanning_Tree/KruskalMST.cpp b/Minimum_Spanning_Tree/KruskalMST.cpp deleted file mode 100644 index 222e852dd..000000000 --- a/Minimum_Spanning_Tree/KruskalMST.cpp +++ /dev/null @@ -1,107 +0,0 @@ -#include -using namespace std; -#define lli long long int -#define infinite numeric_limits::max() -#define Min(a,b) ((a)<(b)?(a):(b)) -#define Max(a,b) ((a)>(b)?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s , i--) -struct edge -{ - lli wt; - int src; - int dest; -}; -struct Graph -{ - int V; - int E; - struct edge* array; -}; -struct sub -{ - int parent; - int rank; -}; -bool comp(struct edge &a, struct edge &b) -{ - return ((a.wt)<(b.wt)); -} -int find(struct sub subset[], int i) -{ - if(subset[i].parent != i) - { - subset[i].parent = find(subset,subset[i].parent); - } - return subset[i].parent ; -} -void Union(struct sub subset[] , int x, int y) -{ - int xfather = find(subset,x); - int yfather = find(subset,y); - if(subset[xfather].rankV = V ; - G->E = E ; - G->array = (struct edge*)malloc(E*sizeof(struct edge)); - return G ; -} -void KruskalMST(struct Graph *G) -{ - int i ; - int V = G->V ; - int E = G->E ; - lli sum = 0 ; - struct sub subset[G->V]; - fr(i,0,V) - { - subset[i].parent = i ; - subset[i].rank = 0 ; - } - sort(G->array, (G->array)+G->E,comp); - fr(i,0,E) - { - int x = find(subset,G->array[i].src); - int y = find(subset,G->array[i].dest); - if(x==y) - continue; - else - { - Union(subset,G->array[i].src,G->array[i].dest); - sum+=G->array[i].wt; - } - } - cout<>v>>e; - struct Graph* G = createGraph(v,e); - int ed = 0; - int temp = e ; - while(e--) - { - cin>>a>>b>>wt; - G->array[ed].src=a-1; - G->array[ed].dest=b-1; - G->array[ed].wt=wt; - ed++; - } - cin>>a; - KruskalMST(G); - return 0; -} \ No newline at end of file diff --git a/Minimum_Spanning_Tree/Prims.cpp b/Minimum_Spanning_Tree/Prims.cpp deleted file mode 100644 index 242040193..000000000 --- a/Minimum_Spanning_Tree/Prims.cpp +++ /dev/null @@ -1,225 +0,0 @@ -#include -using namespace std; -#define lli long long int -#define infinite numeric_limits::max() -#define Min(a,b) ((a)<(b)?(a):(b)) -#define Max(a,b) ((a)>(b)?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s , i--) -struct adjListNode -{ - int dest; - int wt; - struct adjListNode *next; -}; -struct adjList -{ - struct adjListNode *head; -}; -struct Graph -{ - int V ; - struct adjList *array; -}; -struct adjListNode * newAdjNode(int dest, int wt) -{ - struct adjListNode *newNode = (struct adjListNode* )malloc(sizeof(struct adjListNode)); - newNode->dest = dest; - newNode->wt = wt; - newNode->next = NULL ; - return newNode; -} -struct Graph* createGraph(int V,int E) -{ - int i ; - struct Graph* G = (struct Graph *)malloc(sizeof(struct Graph)); - G->V = V ; - G->array = (struct adjList*)malloc(E*sizeof(struct adjList)); - fr(i,0,V) - { - G->array[i].head = NULL ; - } - return G ; -} -void addEdge(struct Graph *G,int src, int dest, int wt) -{ - struct adjListNode*temp=newAdjNode(dest,wt); - temp->next=G->array[src].head; - G->array[src].head=temp; - - temp=newAdjNode(src,wt); - temp->next=G->array[dest].head; - G->array[dest].head=temp; -} -struct MinHeapNode -{ - int v; - lli dist; -}; -struct MinHeap -{ - int size; - int capacity; - int *pos; - struct MinHeapNode **array; -}; -struct MinHeapNode* newMinHeapNode(int v, lli dist) -{ - struct MinHeapNode* minHeapNode = - (struct MinHeapNode*) malloc(sizeof(struct MinHeapNode)); - minHeapNode->v = v; - minHeapNode->dist = dist; - return minHeapNode; -} -struct MinHeap* createMinHeap(int capacity) -{ - struct MinHeap* minHeap = - (struct MinHeap*) malloc(sizeof(struct MinHeap)); - minHeap->pos = (int *)malloc(capacity * sizeof(int)); - minHeap->size = 0; - minHeap->capacity = capacity; - minHeap->array = - (struct MinHeapNode**) malloc(capacity * sizeof(struct MinHeapNode*)); - return minHeap; -} -void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) -{ - struct MinHeapNode* t = *a; - *a = *b; - *b = t; -} -void minHeapify(struct MinHeap* minHeap, int idx) -{ - int smallest, left, right; - smallest = idx; - left = 2 * idx + 1; - right = 2 * idx + 2; - - if (left < minHeap->size && - minHeap->array[left]->dist < minHeap->array[smallest]->dist ) - smallest = left; - - if (right < minHeap->size && - minHeap->array[right]->dist < minHeap->array[smallest]->dist ) - smallest = right; - - if (smallest != idx) - { - MinHeapNode *smallestNode = minHeap->array[smallest]; - MinHeapNode *idxNode = minHeap->array[idx]; - - minHeap->pos[smallestNode->v] = idx; - minHeap->pos[idxNode->v] = smallest; - - swapMinHeapNode(&minHeap->array[smallest], &minHeap->array[idx]); - - minHeapify(minHeap, smallest); - } -} - -int isEmpty(struct MinHeap* minHeap) -{ - return minHeap->size == 0; -} - -struct MinHeapNode* extractMin(struct MinHeap* minHeap) -{ - if (isEmpty(minHeap)) - return NULL; - - struct MinHeapNode* root = minHeap->array[0]; - - struct MinHeapNode* lastNode = minHeap->array[minHeap->size - 1]; - minHeap->array[0] = lastNode; - - minHeap->pos[root->v] = minHeap->size-1; - minHeap->pos[lastNode->v] = 0; - - --minHeap->size; - minHeapify(minHeap, 0); - - return root; -} - -void decreaseKey(struct MinHeap* minHeap, int v, lli dist) -{ - int i = minHeap->pos[v]; - - minHeap->array[i]->dist = dist; - - while (i && minHeap->array[i]->dist < minHeap->array[(i - 1) / 2]->dist) - { - minHeap->pos[minHeap->array[i]->v] = (i-1)/2; - minHeap->pos[minHeap->array[(i-1)/2]->v] = i; - swapMinHeapNode(&minHeap->array[i], &minHeap->array[(i - 1) / 2]); - i = (i - 1) / 2; - } -} - -bool isInMinHeap(struct MinHeap *minHeap, int v) -{ - if (minHeap->pos[v] < minHeap->size) - return true; - return false; -} -void PrimMST(struct Graph*G,int src) -{ - lli i,j; - int V = G->V; - lli dist[V],parent[V],sto[V]; - struct MinHeap * minHeap = createMinHeap(V); - fr(i,0,V) - { - if(i==src) - continue; - parent[i] = -1 ; - sto[i] = -1 ; - dist[i] = infinite ; - minHeap->array[i] = newMinHeapNode(i,dist[i]); - minHeap->pos[i] = i ; - } - dist[src] = 0 ; - minHeap->array[src] = newMinHeapNode(src,dist[src]) ; - minHeap->pos[src] = src ; - minHeap->size = V ; - lli sum=0; - while(!isEmpty(minHeap)) - { - struct MinHeapNode* minHeapNode = extractMin(minHeap); - int u = minHeapNode->v; - struct adjListNode* pCrawl = G->array[u].head; - while (pCrawl != NULL) - { - int v = pCrawl->dest; - if (isInMinHeap(minHeap, v) && (pCrawl->wt < dist[v])) - { - parent[v] = u ; - if(dist[v] != infinite) - sum -= (dist[v]-pCrawl->wt) ; - else - sum+=pCrawl->wt; - dist[v] =pCrawl->wt; - decreaseKey(minHeap, v, dist[v]); - } - pCrawl = pCrawl->next; - } - } - fr(i,0,V) - cout<>v>>e; - struct Graph* G = createGraph(v,e); - while(e--) - { - cin>>a>>b>>wt; - addEdge(G,a-1,b-1,wt); - } - cin>>a; - PrimMST(G,0); - return 0; -} \ No newline at end of file diff --git a/Minimum_Spanning_Tree/a.out b/Minimum_Spanning_Tree/a.out deleted file mode 100755 index b763fff5e3ca753728b7e0081d687a7f9370d3f3..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 53424 zcmeIbd0>>))j$3`Gg*cJA%qYDVhkVhlf^;5Lk=l zI|@y)6|aZu7!IGI5`@q2NWj3`b$JGwd|yC5%K1s3ES+$rF0VhmxU~ER>f){GjiH)Z zrPCYhrZt9|JGM^SS~hFitWtM-i@QYXP5w-~bVaq4Wb{~o7-i1Ehc-a^is{qO`_4_@ zUU$jHRo`?y>^beBCvToh+7NumL)9w_W||{7@*av$`yJ_yG5>sTK%w_n%ZBeBv$Qlm0*Y z!T$sJq1H(2?xOVwp?`ocpZoElezLUxAdXK6AL8$JdGH;5Qjm{)_7$%eWR~V*!M@tV zb+uEb(57Ztet$z#OS8W{9B2#s{g(gS&Hk0ahERJr*tV!K(B2+wxBTT*%l&o1HjS=Y zzNoRKIan2_X$&e_a?08jmEp2bOS``&&>k!;Zw`eQ7kf8be&Aag+r1S_R#vuD`n`e( zwY7U!hN8i(2v&wmgUxk~<+YXJ;^Nv3fi{1*Ef5N~m)Cl|D}kEdo4y_K_2hrT5*QYBZ0XViw874O=Xj<6)9Fk7jXTB8vtqjsaecEd)0eIV2b71eGH z_yghK)==1L3N$vh)LKo!rlyw7sK1{XwfdR@V7_!&`NBp15_f4NRN|hg!mC&NX8^As z2l^@h@o}Q>Iuib=WHzw00rs;Zd~!me!R+Y)jq4Z{8o>M;b^F@r*$gs0pYWtx;W{1G z7EM1neZAn>_cco5#@;vv&_9^R*bnivGxOwW`%DKSmQO(pUe!(ID2%}y-%3hR3_f=J zDT~3!`d?2Bp1#UFz8E|d5_u|O@EH-TWv!0E4~)UDkHHU$!EcDcqX8mMYYaX!g0-xz zF?iD!B>OtwbosWY{%T@@<-2xYIJIY-AP=~njLD2(@60EVq<8!Qd=J4`)jOW?4NP?G zXfK}edl;wcj~$ly!;Et{IJQsX-({RlaO@$8e}i$V{@C3T{~F^|`LUf6zm@Sc#;=n2 zjf}H-kF`qtYQ{MXA6qZ+OBtuCk5x##jd7~@m`CE5FizDTE0TB(<5cOf0>q2oD(`xJ zov-WnzRuU)uBa+MxNkjb={vap?RpaKm zNIiZV@}#kFLw#?CR+G343$Tjt_f#eb53_08PBvMGYg+gB)z5-M;-tQ>gBsqpJS|dJ^gG-)?nz_esE$(&atiJLo-(RI~w* zP(o*qjVwoeT~GKRYI)ZS3my}?i636@V~Ka}vmuSsx1+-OC}o$7_Tk4F-Xkgg`hjob zzAWFQ11!9ApA((Jfh-QNKYGx+mua?p_nz(DcX=U7hc)c=)xNNO`QENUhokX>iw}!m z@AU4qj}w2tZ@X0Zel)dK$c{k{Mew-xH%y@$^BJ{!L16d543$A!B2YM=J)e-$Mj+U|1+ zBN6o|+f(X>RH6qh7rU_SJ$&5WNd+7$MTbDT!@jPke!?NN=h?sa_CC(Z8!P-ABEGKQ z?L>;6I^PV{{um3cCw}|I+C*R>MX}a#64tRpvE*po6A~^@0QVw_@pZl2vkI8))i0vl zu9r~EqJOd&@7o8xN1;x%;fq~fIFuK6RP=ULzj*DwAz$8i&AuVm+(BLMpd~%^6JeYc zVf;JI_@lp(6N~E6n9(9CT^AK`6b4}$sQO6f8|XPyS~BYIgvz$*Lw$n!@O3#ly+`e1 zRn%atRF_f)=0eT(pc#~h-M;)JG&o3l5H#pTqDYU;>bm^Hu8xzPmw#w?O#IU2CwqJ0 z!1I6ddQ2Q+9|?w@9|Ju?9M~}XP>Y0 z?Q>w-lb-N(9cH(R^PTAMaPnQ%J*rj*dqy%Rl(>C4YEFM37Ihx5F;0d~H?h&-SD*>- z5)Xc(5&%5nt9~w|k5s(?e2f4`rL?oXZ->wKZLd~kE0On~6eq>;*tcUYszsl!N2adl zeO-U2t~p^R0xe%r>+8Jy zh}AI)mC^~2L9F3m&moj_e4($i>4=TIATQS>(cgO%Pdu^YJc0_4jLIME*`|6S!rr6D zukTMeaVk;b%oh$jZs62b%L^t_9v6Cjsi-r0;B!4kKs`P}WrDIOgOCdly`{^N254J-U_nlm==xZe5$7q)60lfE6~t~P^W#U(?fks7+x9! z$dGI9W^=(0W1Pu?1ZXaNgmS%5st=)%BQW=ew7$Q9GOpPdUL*;{`?I-GymTz2te{xr zgTkeSmLUgFV1#7UX%_~{FSw590|BlFd$uq^7xi#N_o)Yo>GU4SI@So2*$E20O2jY! z<-M4$RTN{;P!>HF%^sh#y+_025jxC5vLl5+jnZ*_s*sae$DdE$evn4=3$Ae{{wOnw z$|D6GX+KMu%kq=Z6$+G^k4IZUS9!<}9&E;FFItAt8C68-d!wZn#Jh>Op3r&nj4RGS zuX{U7i9=%4IR6Qmj{iK$iCRHLk$?>Yi(b|RvBaWby-^XbhEYSr%RoZoET>~L(l;m) zq?e{OYAb`_$2hgoSz@`BMzeq$JH2Q+m0503Ss--;{}zRAPr~O-q=i(&L5fZPKTHqH z>mw@XL^^$JxjUGC7}B$c7-6;o8P!v)#zjvmwKOA)TAFd4;-0RW>lNJwluYzxlFg1J zLmM4`MT&%%Z%bq7I9zF5UEX0omiFHf>9X;{P-M(vSco`r$ntXUVU?KE)xsFVKY}tK z$HAU`WGfR^)aGE%e@S#ds7Khtx?Z7E{E-xWpfG-IakP(*fSRMj+^?BQCJFJwTc7GltxJ4cZpWWAWn6AwN~y zi3vK?8};nc+0c_@*+I{Ch%Vn$L1|za-Jf_C49HZ#_6{WR9$MbDU;Fw8(48<4AGX37 zsOVw)`1f{VLW?wU6?^qBF%@GApsB&B3$D9s`6p_L#F^z=fH*|1>&aLn8f;LDPUStm1$D}wBqe%Ua6Suw*qxHDv zMlM#ytd!IMa1svsq!peHLX0+4@UIY7jlH(&mTFN_fD$6fnMO^0?ZZz$xwG$%+?XpR)!&$j}`~T_edA|oD zUHeuz-|WvW>w05Z*9VKip*QDuzRo9Y-<;zeZ@^)?F1&cbMGG!oux^3>$(_;t+!IgI zoq`)uAc%#U!?I6vp1l)xRE+quDByPpKX9zKm&4jOpo24E_XhwM11>$@+uI1Z3O0We z;QfFP06z2Q-rg4h2VnHR2D{%&0q+I82rvcsPQdp7_X6f%W|xBLNGV_#unO>Iz%byL zcYAwp2mB`BBYNW}K0toJ$$v$Dz*T@R z0)7+lL%`#Jqp^E`J68R30h_S#aS>oP_GP{ZSO(Y)xDs$L;CBIE13Unjl4e=&0G+fcFA^1b6^&3HFj+13dR5Z8 z079L;gIwx78qHzZm#(zzty%VIgVJ3)?er|3Q}YhO$v^e>PG$oA5YHz*y@fjwDt*r% zdwY*EL1xyH%)E1l4BXTd9pyMjIwA#;PY&$&FR<77fRS|0IgxU>3cCKS-rhMNN9bY2 zg88dJzZ-O4EZwn45|ADS{SfG_arBK5`t6|SL7$^y>D5vGkAR*H`fagv$IX%aFM@t8 z=vT+lFOSgQ1N~2+pBqQ_M(8=v&rrxwvf zd4wJYeG}+c#L-n_Q$M$Z{v7E2$@d88e*?V`^@zyl92aSy7eTkt|98akzadiod!RRi zJ}s8MLC9kFIq(;kfxax3PJ3La(hyBKdAZ{*r0cJpF9Q7_=--Lu#}`4bfPeaR z9R0-zy&Loa@K@i8qu(8&?*;v4&?m&w14>59_dC#U2R)e`u|IsM^RJH0zw{<&XNvAL zz?09JDVFtkKYU1E4Em#>C(|eCya@DD&~J`wudYaYT?6_I_}~8OaWCj|K$r7g)9;lz ziF^k@p9p%gdb0f2Kpz7-$Ek?DG)DE50zX{>dVlSBCg^KH=N*qoen)Sl9TtN=ALBz? zEPqE+gkA^wPSCf+(c2>QYe4S-y+8Ty1^xG+_ov?jpkEHZI6s!Z_MK9H(7z7)@K}0< zs{dl(QZUXu1pYzN7iMPN;#ioOceB%*S+FBzVP@e?slLpj>(YFgWu58gXL?#Q%NAr7 zEyyffm|1{yNWU=CCHJ6~fzJ`}LHGLi^KT9OTLb^rz`r%{Zw-8|8h9H={Cpl8qTpd2 z7bLzoWb;Xc=AP#uMYi%>9tjQB@jBdQ;=@B^KIVS)X(}4I?VwA<5IwS z|D)a(26sC=1d%)6yHivgL#8~39Ug%h@{M(`7I>hJ=V>ToxDFFw3a1_%t@ANsZ<)?- z)^}JU$}>X4qiG%q8T@V?H*(8d2q}2sjE^ZF%TTG0Pp8MSQ{tvvOv@!cTGLhT&;Q%p zV^1vU0^P3l8gAC`It}m8@Y@>xNW-Tzd`ZJUYWRVMY1+$cBrS3WIl4-?7Dsge~qyoWMUxbR4mQ@?^ zLJyxknBDO?tb2g0!V&+gj>{?)@uDmbzOjoV-&k?$xU52f>(Oyz(T<@WNhzyLgublf zR}0p%Mr14cxjG)u@f&sgxQ_Se_%Da4^s*`hZcL7f%PJ7@yL8;}JEr5Z$^(69u1dcH zVLo^2_%s!@p3!kxwE;I`ghwc*zJ48-)fgzQJVlq)7vit#__rjNWnDK?(I@Em13GT> z^OTOu>IrG`N2&CNUZ&$lzMziFDhTOMoTkzn{v$`LxVhCjQO6Cx1v)OP802r$aZ|rN zIxede&>uft@sm{v;zju?E~^m4@7Hm|{|Oy8@*+vxb7-D=;{lqp|27!m>$5HE+wf0C zamiq$xbJR_w|^Hu?~9v~PrYh)h4;F>c9)P55(rw$JOr-1sW1T_3sz=n4Ogwo-tQwLu%TENB< z0gaUcn%V_yx>-Qm4+MmNDWKzofXyS}$5RJyoi1RTSHKs)AmEAy0iD|fTywL4Yws6u z{T=}~JTGAT2Lg83r<2(&xdfS;FA%WhIsuoZE}(O|QP4Yjpy?zF9!`9RmL2hXU?=QNZ1A2)Ji>0kePf zBZ!oi>9li(5~kQiK&NG<+2;vNx9=3_veye7U|%UP!+sPnb;x-y2w3^Pfa)P*h`eyT zfQvi=F7^vpcewz6w}AC~2(sqxr$VykJu6`TuLbD|jU{qHSir)Y1uXiGfW-#{cwZN= zByAj1E_gw(Y=M0Ir{AARHVx3XVWH2UQmNn3S zL5Vdi*D(kmW*mG1iR@7;GoOUz4?S>G4mLzR%(vt8p@QjeXD>Sw+OiTTLNy`FJR}Z0(N~U;MNgmGQ({p0&ZU+;LDc?xZ^4T zU%5%Z?uP|@^<@EHJ1OAn;IaDz z?0rGN|GXvOCz*xJw||m=C&~pp84_@yOTbU>7x2{M0uH_+;Lt|`p3a}d>_3|?;F)Rx z&o&D9`Hcd8@f`ur9Taf*j{s>oE<0l~;Q)KQzzo|9m>xs}+QW}Mn1%-aiOaHvAAg^1 z{hN^pzWD%xL;n{hH2mFc1jnSpUV_M#u@PTZ_B$z-H7vNv8venzkfsrBxrix9R4Ilv zhOOa$?}Q1FxIUhka}{vI9rkQ^AQr@3p^Qz;D_^Nj6p`~=8)-7^*U>|XxYMMua+U)% zJk!1p37Gx~L&;z|ReVk+YmsYDg%{m|G=F3o24YLNnQ8Lv+dvZ%6wxP*s9=H}(tO;J zG*TATVCC$k^4xYB1_>g3OmjKPva)%clJhc)DYc(PH)p(oWYJ>IZKRah?+;O0y3S-& zxrYZ^>aF2(?YZE~jJY1L9PY6n!bF~NmC71%40=dmZ_J%@b~^fDHQ3o%qoE5&);}^p z%lZ&bz?HQM^~}n;2h@Tr?jw4#)OiszW1a-o^;n&D%W#v5z z*{y=Sk039y-FBvBJ(N`o+_`ya6HtIX@_BFt6HG;RqFg0S(>6*o0hVuPT>+9KtBZ-V za-mCC)=HF}mGvZ;6pVCX@KCvf7}8YkFMp4@Jp~|S9l`i&XAOmV99f-^A!X$G%pm2p zjyE|Tdzm>hA)J*p2!pkq^#honV`O82PCM!^7?M5E$Z79^VCPmk?D?qX=I&>@lm6IoD&iBfD*9uLc-f7p%2%7b%ou%tsJ4cZrIn zjNK62YUP%zm}|^hG-mD!70ViPFIlZrv4XKJwP7o_TE#qLE}}GRRP3s8?T{n)A{Ddj zao3^IbJy#rV;quNxpg|4GOh_ST3YuxW(47r!+Xx6yLSeYgrEf{B`>2f#esAtR_ z&{}R-MIRbd&$L@q?A&n!UZL^psw6o z6v{E?Iv7Ci?JAZsW>EoRUr{k@Y@oH(%KfhWl*-J;9gCOitlS3`$}y%916l6FDwZ-9 z@6_e~P(@s0`O;qQqbim)<|zvNn2HsQtqC?*xj(b>(IB>!eIEJNcC=Z!KUXMwEM6zH zau2JR!%7{o@?Mxp>WIp(3aFCtaKuG>Bo=&8z=l5y2stqnkE(&@cVu9M-VSr78$R=4 zsPlESjy38Qe19i7%{c?UA#YK72FP~W!@mQ_EQMvH{jd>SGsmMBr2QxhJ#xS>m>~y! zD}DY%rhTyhw9E{I(_SKe{8wQ@X)kl$(*rK-KWcsu$vL4DjM*=60`WAasAPnl$G6kDB>WX~94d&(F%RmD&T%prwI=-l(-!9~ z>5q(s7ljLr=2(NQ6hjJ2$V$A<&qH2kWqLLwS{j$1GA3kGB@RRzIy=+<2BW*;<8rXJ zs-T<-_#@}m^w&@{v5$OQR#n(FvIt3k0Mq0@ezF|HsltWnVdy>&Z5UNZzZL3%6*<3@ zRu2B>e_W1eg(l5FgQs3+^Umv+J}#S7X6Sb?MmSd-LzVV2gR$OZEhObc3(N7rOF3)P z8(^Zu{`KPujLG^J^d|dK$9}XIvD2WK0X3MTFfyP)2V(4scxzG`k~{O#w?j8;nIp~; ze-yDqhO9|Dsfu~_GqCTQ`Xo+fL__}*-Y@kyFPJ>>aT%gj87i~?t^Wl__-E#N4rNO% zUe$qUEv%etU}*Mu`&O7S`~FaPf{4Z?ot5)?0h0I~)8V4Y<_kzNAq5o{fAH}-8afvB zO?~bJ4Es)UkErOCfvW38oJK+mOZSs6@hD;(IX{Lb?NN3Q@>1UYN#wl_BfY)cF$QGH zYr~NKpX8l@45?q_I(r2|A1Cj0*o{(Xg1jVHL$8I~OMfUAhPVmLB2~>8HWk_UWo6Sx zPks~KYE;#q@O>@PW&aaRp7|PTF!DwY4O94jxohq;xa=E2&in{f9Jyl?D3d?HmuucT z_`VmEse4e8>)fMgE0{3K9{Rsq(86ki;+2%4ulx#$QZrxT8aOrck40$O)XaCz6Y%bO z0VlZLP0f6t!$E512af^_s|#(mGXL-%d|Ig_i+^kR4*S4s=* z-TgC&lCnuW_Vf`DD5c#2_qze4c6{>Bpaz6m^ao^3x%6rHSlU!Ks1M*XfP#qO-lzjA z4^hfABO?SN5+&dar1;d<7dns88AhJ@yk)`lpo9+h*o3W z<5Ea(D&CE{q3*5Vz*T-<7JCk|K87^`^j_>?)87^~opj!FoG3;@_06&<&jA5U9Hmo>* zImM}PpUvVq5IF|)6DQi?ppF`VfbRJ zEDPgY{ue1UH+(aw%M2T;wC22sX3M{F9k8=q+!{ukESBa?y#ei3nw4@5NTsfnE`pSl z8=YvccOcdoXWRilq<<3?J2Yl2x1-$;pr|p0*E5g%oK%D-k*&vF1H_ogWZ<(hPe7D0 zMW-YES+4@a4Qvqwo~MQB&RqmdhI}zMD#>J-9T0PDAqCGo3em<^`;lz6D~Rv;t;`{b z&zbFFM0Om<9iiA~QJ>rwmqMIY*`4qYW9zGc;WoKaEMr#LhtT5K?c}rHP^`=$sNb1| z&jNAQ@9@Qs7B~GFC_it!#cg)?GsrdG;@*knz9$k+aeo=TXuS0nFfMls>{*4gtjt{U ztzki#i{Sny6io-4^m7nAGV%TI!z$d*AnU{rq+0HKU@{Z`L2GciOOR&bhYV-Ak3%05 z|H*Kky9x{@e#CHrdnUTY#9oFAJrmFp6D^yOBF|`Mwk1;LS&7moIwa!pyoAwfVv0n3 zo-0^hszfS0XCvptG>NSCJPjkA=(0DV53cv*qY@J{>@A3F@JvG8Cl0bHaI2>mrZ_Q6 zB4JM@BiZ&IP_}xWL*j|K_7#X+<@pDUVd4n;Hbk!W@DOHVo_#qIbb7vpW|}zK-hs#s zo>gQp-u@|)?ettm3EVbyy4&*|R&=^V?)F?wN|8kF_jEB*ERlyiI~gglx1hq0dR9c-RzkU4@muM)kN;wIHSNg4Y2T)`C#DnytLhje-j= zx*7~E_X}v)!Yb8L^T46-;-`>0#mf9G7!e!vFbxTs9kgfqt_%iLHx`k-b78v^vTR0pS|wgnxlV5}v;NdU zGxz~Xw4n^f)R)RX5o6ngT*=QCi{{q?{)yf7EfMC7dY56T63c_uSqoKzqaNfn(T zR3HZ+TWVpU-6y>3pf~1$ndbcxq7!n2H_y)$c1b&?$`eK@>_1tBE2Q>3QER2y8{_5aSoGNtjFwFEOEVFqk zr>a0bTi#CgkP7KMJgJM4R1;8{)|~ILa!*n*WsOkLgy)$z7kW|RdVh~~!-U7BLdC>V zB30~M*W{Wx1sGLDJBP*b#B(=OY%`Go(!t=8>v#A zzL8<{t22;da#KL1-@FfWt~^xwEnIu(^jjH5`u)I6-nI*AGOvO)OgZ~y@X34-UsKNe zJ-&Tg#~{J$jz1v9Y}YY-ms7HTB9IaJ0>z2>^ts;eK(~|ArM5h>%-BR7m5o5JoxF1! z3giK%ZlG~Q-bP+L&eTZ0!9Mv8R)zC(h4ijOS(D#&(1Ll^87(%(o?k{9>pU*ECg(V* zQ67gXWs6e1S>wQ@RE&v7q?$F49VX{GsZySpD%%#Vdar`lo4ihJo2RIfK?=0I>rku7 zA*b{v*hoeOzc^!2^x3W~AWBnGzk?ckUnxN1fbik@YhvQX6M>xkp@WCAiJep`wPY*m zJ$bX3;bN{yCvUZRW}6`+a9J;0)8u=p+nq#;6bzwBXo+QqV40Kun^oe`Zj`QiaM_D+ zcatBx31lAmCX&4eP^rn!N_+AwSm>6w8?%zhjjH~ropMVV3`w6r{SnTl61){O$Dq`{ zD3X*E%e$1iAMK=havdGBFfRKoy4&RcpoOj{MJ9t~_t3VUC-O>z%#b=u1DElTa`H=c zAm5pcyoY*t;3|+GjU!uS3&{8TZJ@jmPZ?hhF{ZBIH!b~rQpMz1psH%wG#KpEuMoil zZKXdE*ZVzac51gwC3wiK^zGdbF{WN9Se|(+)v5ZehE}J3jT+=Jc$A__8t;bzPyIE& znVd)Dsx+y6&N1}esf9KH$virb5oY|I6!SfPlgbnI*vz{q)FPXJWS*_ZWL_3-vdX4h z%cFL;&w^jLUW#=4Q0XZ*Fr4E4C3G~Ui(!|$9lDxwBg2E-UxaI(BJ<2F_r+j8bC1TbJLP7EN4vj_snC>L7%p%xM1fOorR5g7XTn2IxsAdVS#vIjublEf z9DB+pvD_zV{ak5e@N$5BS!L-MNTwVl;+v%K3tfU$EBiL{?<47PlK2G@#Y;q{ugRd!nVR5`_py*}kF!d=Xh~&isjr?)} zkUwX8R}m>=ySNlqQ_DYYFJW3b8Q9*A!n9M!m>O?Qy_ zznq0#!ik*s|G>U5VDl7(cL}upjX<#Qn1k5Ih~*dL=Pca2l(aM_z1gdziCbe^s8rrR za~}9t$;*of8SKWIbOuJb!okwbc{w3NoPqH6Zb1Qs=ZOp9g$2o=g}I&#R|<)j7!-+F zms{RVq+KR7-fW1Y?jT3>$G5ANl}uqepcD#Y_4z8ta(c%DvniFPqW%b3NNn2Qn(f`yp7y=mnD`P*9?Up zvPF2kB_@yeF4lXM43fO^lBgW$Zw??@=tT&XMXWlkiuBq{IWL`$-~?@_-` z*z~-vLPKH*w!@;mj&vk=+U9`En>#A6B=8O(X_U=myv-9+KSj?X{Y9IOj@NvmS+(1E zo=)!9_D!Jk{!b#kYz>uqfVH_lo;^{P*F~!iN{8l!A?X&DcN(NA^a_^uhoW^=TJ^Tl zSCos;yjTnS$#X=$JiwF$_Z zx1nM(=lC$<7S6Q^NantDG`H5(GZ>o+pRqZm8Xuvnw*4N)u);ssoW*(LNV;twVtwDR zIgJY@p|5c9vd{__uU5_0-wMN-eC92fb4@E?56-4_VBm(nq1=lkG1 z+x0_yXLAFq>; zX07{s%*wrMh0NwYb*amFH9Avima`a{OADM|LE%wB@* z=P%=zhhGw9D8=DGdsyjjW?%=zF`yf$rCY+5V;~i3Ep2bBwH$+35tsXiP?2LW!-K4J z+r{)lcpkF!0?RR!Xltq0a>&kgiu*suBJnViT@(axS$ju~<#G&v4`KHV^mfMx$>d%E zDIIwXrywbh(#~g^a!M};J&`Z86FJRx^~yKTMrONsqJlje%ylbx5hC$cy4`)zRBTfF z{ms1eKo{WHwZU5Xb4qyl@eYdGA2@ z(SsDzaWG{*cJ~rDm?Fx=$@xrbvl)9|kl^N~020qyQLko4kz3_^mnOt5CN4nT}G!AN-V8rX&;aP0D} zfo||Q(G4+ZLMDutg{^J$kMT^VpRvakHfEGRn|J*!AX35!tVA?$C+K9 zJ2?Ig&@^u8uy3Ii{J)2bh(y=>&w#BtTe5lX2xGI>@i;W`O$@txD_NUE%4+6G`BEec z@BSpdtYLTml35NF=!0N$IYmkH?esWlOjJvAUpjj#s%@>WX5dwD`T(E6BZx6jBLcL` zS!p&;qib2%_yM?CkmW(ESQb`#^4Q(^McDMgr;c1u|GGB>uD90l0#f2TBzE_cNE;P< zO+msXBPIVWTK?5an>%&1!e29lHj}R0hEFMXm#&UyZP8GVNEMK83@{cZbIz|DWmwia zUU5o%j|Fuoj+H51m6ay95~WHO@*xfgrf^}zv^=@{BYa*=0gs#=m z)vA`)MN8tXsl=CU?Cy6@QPS23FJZk+M=KQTZAO8?S25^2FVoZw);eCYN_>sS?!L98 ze|1ff%+6hpUa9moRmUH?Qk6AT%5v_y`^vSWhpE=OTenud-ygD^MY?p~+AnDO0@Ip2 z#&gb0--{86#*60Um9E6sitO&p8U4$*P_x&TwMa*`CKee@to@TNe0H30UY&dc%I4*; z#8;T??ysJr>@TIMUb)&Y?R~Y5Rwzw%>ZrEr&NS6YJ!>m+JR-!hI8mIRe6Q740c8Zm<%t*AtPpw9xK5HE>v?RXUW_Rx)Yq~CaZ8d`YAkvDwvzPe#o83KO zR-#5ZcT+0N6P-yvmJw`ZI%&>b4_z6QZaCU>!{9pluG6)OAs%o0CB9l`cfZ)DED9$z z$HhO^JmNDVaqTlw=ZiVgXZT*hSev@QrVH?0j>@JkvJWC0d<+wlRGeIVP1cb*%M`i)La|qg2q(@)33OuXczrSPO+&l;E(-7*Bqqbi3rf7biS{Ca@ze#+N((djA<#v4P$c2-P^98QA z8hCFl@kL9!`==oP8K1~)v4{qw2eWwgU|Mp@{Y>cCwZ59VNx5ICX0=*QtmBo=#P>Gs z?mOmyb;K3*e_K--%yXJ$^*zI2Fwd#EOGUMq>|s5VsTQj^%+(a_MVZfG?GabqnTL!o zaFZBPuR5;)v0ti;X!Zk`+$X+DYIh%{i2WE)FwTHL%^w zh}rPEYU1mucK3Xwj3`=}+Nh|h@j`0iE39_+!^rdTrnWrZ)J#;Hnu+>?eB;qx>EJy( z$F3G@9dGs}z9wsTzfL*hUFFvzu9BBx6W^q@yDvTa<6E3dUe)4XjBD}BO^Zu2>X=Wp z_~r2}eg%1OfhE4{DwPrQFkZJ!e4W?sei}kW?#+sCNPmbpctG(D=@0!vVxCpM0o(K+ zvn=|Y=yDn7B}kD?!n$b#u`tQ^prP^NmwZE)-RI1WDMR)9c@Dn9fW?fA6nMu$MRjA$ z(@o_Ix>2aT*umSqFk5T=Qr2xb_|@PeZh!&h2D+3R;62b<7I_j|{rBg4M2t}pVQvKF z>-f}>3*Ep40^tUDi!|~5WxM-Xkl)8AVw4eoAZ~!g(+x<+zeTm#dgT;uVK%PUL|2!* zavBcghA467N5mF;8UeBA*iP43 z1J534gN<{J<;-LRF7YgjfjnSSU6Ej#1XGDkA7(o<2M#n@U2glFkt%a@=3MNN510;K zcFss@sALhv(HqvWHs@sZL7Min!m2r`!sBh!hI_7(jXBBzV(GAWV| z3RP8~T&mlRj8t8x02OHog_>$ov1zcM3&RszqYg0st4R5Zj5h&C_SA&Tl!vw+g>_ssGXhe$@|Jespl6`BSz^!j+GH9#oXeOR_dfsJd;)> zOL~XmT8*T-1(@`L*rbZ5PPi&+ZA`e@*dyC^O*BH<+JW$k+3=e zHOqP}yN)(QMW`F5h1g&Uq6ndZb~W7mC2sV#(vfj0+USNrF*t0(vn+PuQgK*K_;E#% zp_zf^On5Y_MF*j-Rvm;N+@ymr;x-+Gx3Tu2V>ztlPRt1Ge`F5Ew~f`4g^xYGqrGi< zsJXVWqb@idKa)9q=JXo;>ZH{dACJNhwfbk3>R)YbXzn<5-syG0nvRBe4yv%=)^I$! z592=KsPyUHk@FzLl8(81-+B(`d1{#-FR=I0iTcLwU z8bxny3)TheL(RcDe@kn-!ja2{V4yV`3*qNN1L2l7`K?cXcw1{wC*_Z1s$}>jQ2C)w z=-sNtPiO}4>!A#`2g8>%wW?sKp*hf~g5kPATZ0LPT1*I))WNn;v!aJXO^VZ$DYY%l z^`QoohlUjeBbb889ctVb3U6qt-%_W9solaK6ctX<9~O~`RWt8j;M_w{t(aB8@ZcYNkxPi{Gw;TcX05ooeS*gIP`VWHjH^X?M9)(l(tm z6&f)+$($4Jy0ShKC_ z{2P)Fbe)Ta7=z0w+C0q8sPo}?^Dx_=&aY(J@AkN+cdmi#YdWh+A>RmQX4TEUrE{+X z&G4pci))SRTGt83gq+RjEt8!YbH^#|GqKq=biQHRuJD^^s5OrH!-W~BW>3%gSIc&e zc-J*kv;czHqI2Hsupe_|sydlHIOi)VwkzbAJnUu108=Bg9p=2pj#w_WW467V_n~~H z9jS!buX6svwjGm(cXqmt{PD+*sX1#LGln_0UF{qoicZ^;=DPcJM`_MpNAYkYo7qQl zzGm6)nTAV4S!P?v`I2pSI?|NTW(Uam)tH)?Egt8ysLA5<(FvpnQDCzZAGTF#2=(1x7inQe&4p=bq;uq?V#Hf zRI{Vu+zW9Qxz=fceDrVO7Qd4_{nO2eW)?m++x+XG_^Jcw-(g3bnvIUn_I$u{_&b{lfOM! zO9uS0ZVuDSYI+=yi{H@5}>aW@6Z*L9M z@+Yx58^E~I)au_HXq;Qq($ZK^IC)ZGu&yCEVQPVZN%O7Qjg7cI?}vQI08y8;v~3Br z)s^e1L~$QX2}Rz}*0P0pE(kPspe)q6EnL%44ZDPGkmz}?G!7?;cM~%PS?_XO=ucqAuRPOf$+846& zZNcUMRw4eiE7+_tH7>99B2Vi!Z$&M8J60v^&}jTws_j30vrC)H8VJgS3&QG9>@!T; z3pIzrp+IBk(x4xn8!b~O9=pCRQ0uP?HE>-kUKmNCnrI*Bua~igNj&MP`p=?LFPsPp zFh0l_;-~5A^$kIYE^eh>0pn!gEzx+pQdPrU$YGbRx*lR<<=5VM!gyGW9MeIfyzBuxzZoQ=`*o1x< zucngH{+u+d1EWz>V5=87W>zW7bB!~KQ`9yT zscpE$uR00q7nfa+&Pm6kIHxSbbD0{R>Hfr=YGKB*NVmuze~RT_;Jv6s3>L$Yzu8~g z?#B*DE%rd*#A9v$6xD2uR8!o(AAa8-4q(cFZa;@3jGqIh?)fw~jIOMKm~%&?#c`pj zMoq(%*==iv1pY19!tl$I-ipj_s6~rBG0H`}EFJq~HTaj5B)9le89e0JTHn@$o^-wp z->`9@FemxM8fcGdAel!j32ySPJg=6WE20i#uv+#&J0}pB5ve^RVnu&&ruYkRFv$AQ zR@|7}S|12+P~!;y)El~<8f07BLfrA$X4Qr2>w`2_?e#G~xwNIZKbwnpf(cVX?+VO^ zFl~%?c2%%IA@s4>%Gn@U(>Js<1*bO!WR@0aoDQG6p`&K{0<$I6K7BcybW=x@zp^#Z z+>DJDe^px$0xm|~1CU#)U5sXgD~IWDtktH2ayf@s5yeB8;u%qEKlQ~AbVZTQm-OM0HD_%~t#7Tn5ZNHSBHtydwi zhY)ts8Uo=EJhQYtYz}*AA{|q4;;*_$9lQ|yaeX+5DJ8op{ZZ5xRfbEYe~Gv7ZpM^N zym)NqjVuA;+cJI$p#1>GX)cJMv<8_ds9C)@|KwFFX$%|d4z$Og*%#q z^BRK9+;l`VfC=b4>;_MpRa!8up~T5DTN7){*LHVqAgiMNH}QQSx2Bq>I% z(BMCSZfj|?YB6mH2lZeBQz^mJrK7o_10yG#Qv9&<>Fh?_IGhewonq(~r^m)K^tX=W zysgG+!oU~a(9+Q!Xs*MIE{J8?T3KbO0Tt@RScchMWIEWYCrIJqlCsEZkuAh>0*$R3 zuyn(y-U^@F7;1vrH`nWFH9Aiit=5D^bThGVHqBwqw)KpPJUA%?Yz)@3C0heni);5T z!)0Z-jEik1D`lH5F7?V1p2&K=(i2nRgo2Y5t6oOqDxw;(bd)`SOH*K*xzJOmR#}eZ;JRdb30LA9jCFdvS1ifEgBshpiJ7Df_0$) znz}{J%08XJMc1@kkF&w_=+YKy*bvrB8hvi@u}hi-(XDZry-A;z1u{LY>Pz7bAvOtG zT)T3mFl-*cp}=IsWnv1z8LKQKlRC{=YJY(H2mKgCN$dnme5-#2-k6|4hXWyPf{6>2 z8CX5Q3?YLa{wd_gZsSB}q;h~H3khZGn8Q%K=z8H4bEYP5ndv`XhzW;@Zwvz)(48A0 zMi`52%-hYB-Pl=VrlW?!=yn9=H^p9W-`N)TcJy>>o0&Vrcry%;VXT;1noR+p%8>mV zS{j4p&2{*j!2PWN=BnK)bl&+?T61mdHkx7k#!%~)_C(K&)w`*1C3^H$oTCLXqPJnC z*Dmv(WFzb>HI?$Nti_ZIa)iRzSu;+SqY>oiq`9K4wiaD3 zI+|jY*S@VCD=LeeaGY1b&Lhhgt{38C+;LUIiYyZ??Uhh|bS!SfF)j95luJH^1;@>L zPT}1#L~{O&cB{b>vu&HT*^G5&D_Jz8_mg2qTj~NZU$*+JQsknMz@B9hiRk8blN}qI zdPQD5Bd%X-cP?x2B0m~QFTr82+`Q1^D(95-bjaMF}KvvDgGwN31=b?q&F<*O0Fh6cXF zEv?4)B^$XgY3D zpjNCyF`RO)LNm5vreRcly-fb;(qs?#6LmZ6u1BVF(j1t^Z^R0h(>turuqft+vJ~CX ziWz#X%rxWr!e^mb8W4O5B!Jt&N0vbSI!cZb^Eq+AfAQ?td=E9DYwF`D<*O~MYy;eK zlvz%_0vi>;lmx3d_|nFXCYr0PY@<_G-P0Pe0*{$bM3!;!jmKqN+|dR4cI5&;H}$xk zmu!%nP3yo=$|)5l&rKE=0hWJZImXI`GU>(i;cA1}xKUYzBC@1>nb+bHL!DG4adE2UJ`0P2m~Fv&wZKhSaq4-EoE~8b z*Ct0cP(LRU7A6qEjS|*&ft`w&V~tZquCvY=moA6(- zGPR=_Gs8QTUrlPpSo1SabWM}gjrP$u{V4Xqq-MqB5w}VGua2MUG*XS&?aRgSD^r#l za#TbspzUUqpd)RfLY0wYQL&{~#!1lO=5c@=UA@Ryi32+xm!iedHmVnfcxaBD#o)%e zP@9GJLU%M;ub;Oq75PL2UcQRif#paZb7V11SLL3YeBmhJpLPVX8`3V%CR((1G|#F3+SBV4hu%ZHV~Ja*8t5p#aN7-8qugMMU0g?|J5*u6{ZtP)^&BlYON1-JY(1XSDQclM_N5jaVX&Rp zftw$kf@oJ6cM-%4H{5Cqw6$?ct~Rp06;=L<^D0aI@TYR1D%U|utfq}>Y=^1h_iti-P`tDKEIbEP zD+f+uuJJpVFf7@@R711sF>r^vEn@d^Kh>5>ti{iOAM@hEkAIPxyoq&jqcGWlXum$V z&zRN637cgar^1zb9Ecpx$O)}~5hlP@%DTBxDW(_W^z=#1@+iKalNxn_LoRehHipoq zaKjyq`pQoSjIl|MHZfy{ynBR%GK1j#B+i~f*ayed1;=Etr>$FyIbmT##BBzD zn%1bVZ^Yg*MZo?5m`AQ}d=|Dwhte8<{>n=8pwmc7S!CODo@Mju6qoELEzRb;LbMe_g zb7|N>b5Gbnb3fQXb0OG3a}n4;bKloMbG_Fb|wjqGN>#p0@ z41Nk?m=+4|Ft%fD85i+`))s6GFoO=Y!X>$7H`I+2UWDOyL!hA2T{3(Qe%B!xemMRta58+Zb#i(#JYHNYN`}v~u1bm@Y2BR^Kgvq>I4!*2o#b&^ zqmy9qcC>}p(~~?-D?bUA>G5|7k~~hUpbwU>#idy9^d=JU$4t;G`sx$!bfQ-bwki_r z!L9K-6YvW({%`_*mGB>F9o8?SQw~1$_}EF>cL(q+_w58eUzPNI?c`D5lhx~>q#tRS zm*7pgFKPaXuif*nUb5UiuhsX%e*)6m)=+ErL=RF#pHjj1)hAOVlhY&V``Y0Jz~ja9 zKK9?B@rnKAQsL9r{yTv$u=?8b&A<<}qV}AJIG=j~$3hQgIxtP4tv58@44cIoKNfG! zWg~s!-vlhv`1RTkAS#a!0rEG)yXiS!(&>%=nXJ>_pwpY_%@rDdRO8Jw=|+wB;$1fK zH`4_p|8|Wx(=t=;Pk}Gcd1Jwg{os2vA2S`CqcdgV{X~{)rX6_sTb?rDv#q}VbG}Y* zrcvL~>Ax=NbtDGt>j(d0Kll^<;0NP<#$@_mqVZ;$)27Q_r}1X`dYi`Y(RefMG5S2A z@n(9-{>-NuFGS*RNLY6#j60VCU%&(j&mF*1PBV@CmZl#EerU|NgKEn2cj1qA&+tgR zQ=u&vUWY8u;aD&h_^c%TfLdJ>-1*&ZuC=xKPEyxW|>h4f5GQ=jW^4KUn{i5pMK6leG~O_ zLZ>&=XVZV@WGMU5*(0DDc$RCHPo`b|Q{&CF-lubn7^u>l<;^mUUjRJqGx1rY(b`&GNKIv9b7b-b`u74?wslNQ zP8H*lMh`;NH7@LzEW?#7eNh#6DfzMzPJutci6q}%__!Bm{7Y6YSnlOQ;Ii}B~9aS785wSA`(r*<64{PTrD9debMdejj&XQflzY?)sub;eA{0%1}b* zNGhtF;)$e`IYCr2BTAa{b9mQ}$KoxG?cS{klFM~FO{-Y4va+Sp?@dTThoH}GP5l$O zFbOy{mekLdZlNVHuupwqF7Zzdz%0W5zuYT# zUmcFfZ_YS^Fcr1>Z&zd1+c&wTNzP=J4*Ph>RmYqWJK0u|>eoO@34VYjpmFlFN#m%O2JF%XEdAA6szzyMOYS{5K=UBszKI{5DS~H2bY8 zmy*?l3A^x#&2P?mJv#qUCW?8oblAY#5s%Gp&SMI&FUx0Pu7c*<o9|G8#ls-V5Ij1{0jWO=6#y^Sqp9L9Pl9Bx8{M+SL`4ZD7 z#*ZKw$5keyh9;kZ?*Sj1-<;!LrSls(4I7is#Q%-}ai;#}ynm<8Z^i+W zzQ6=D>;+``I(dX@@~@0wRDfyu80bR4gcU`7|6Vh^${405CZ-+HPyU)2D#Nq$V!8G$ zYg|A1-J4XtR@3nPlwaIW{yX)C{(%IAC(1uh=TFpM%~h(vRpuZhp?t%~*H8IBzE5Si z`(yMs6v<56>mmfK`L2qobNML6lxr}ICln#1hrXv$_~`WUjKgOZK1LnJ|I - -[![Join the chat at https://gitter.im/codeIIEST/Algorithms](https://badges.gitter.im/codeIIEST/Algorithms.svg)](https://gitter.im/codeIIEST/Algorithms?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) - - - - -## Sort Algorithms - - -### Bubble -![alt text][bubble-image] - -From [Wikipedia][bubble-wiki]: Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. - -__Properties__ -* Worst case performance O(n^2) -* Best case performance O(n) -* Average case performance O(n^2) - -###### View the algorithm in [action][bubble-toptal] - - - -### Insertion -![alt text][insertion-image] - -From [Wikipedia][insertion-wiki]: Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort. - -__Properties__ -* Worst case performance O(n^2) -* Best case performance O(n) -* Average case performance O(n^2) - -###### View the algorithm in [action][insertion-toptal] - - -### Merge -![alt text][merge-image] - -From [Wikipedia][merge-wiki]: In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. - -__Properties__ -* Worst case performance O(n log n) -* Best case performance O(n) -* Average case performance O(n) - - -###### View the algorithm in [action][merge-toptal] - -### Quick -![alt text][quick-image] - -From [Wikipedia][quick-wiki]: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. - -__Properties__ -* Worst case performance O(n^2) -* Best case performance O(n log n) or O(n) with three-way partition -* Average case performance O(n^2) - -###### View the algorithm in [action][quick-toptal] - -### Selection -![alt text][selection-image] - -From [Wikipedia][selection-wiki]: The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right. - -__Properties__ -* Worst case performance O(n^2) -* Best case performance O(n^2) -* Average case performance O(n^2) - -###### View the algorithm in [action][selection-toptal] - -### Shell -![alt text][shell-image] - -From [Wikipedia][shell-wiki]: Shellsort is a generalization of insertion sort that allows the exchange of items that are far apart. The idea is to arrange the list of elements so that, starting anywherem considereing every nth element gives a sorted list. Such a list is said to be h-sorted. Equivanelty, it can be thought of as h intterleaved lists, each individually sorted. - -__Properties__ -* Worst case performance O(nlog2 2n) -* Best case performance O(n log n) -* Average case performance depends on gap sequence - -###### View the algorithm in [action][shell-toptal] - -###Time-Compexity Graphs - -Comparing the complexity of sorting algorithms (Bubble Sort, Insertion Sort, Selection Sort) - -[Complexity Graphs](https://github.com/prateekiiest/Python/blob/master/sorts/sortinggraphs.png) - ----------------------------------------------------------------------------------- - -## Search Algorithms - -### Linear -![alt text][linear-image] - -From [Wikipedia][linear-wiki]: linear search or sequential search is a method for finding a target value within a list. It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. - Linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. - -__Properties__ -* Worst case performance O(n) -* Best case performance O(1) -* Average case performance O(n) -* Worst case space complexity O(1) iterative - -### Binary -![alt text][binary-image] - -From [Wikipedia][binary-wiki]: Binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful. - -__Properties__ -* Worst case performance O(log n) -* Best case performance O(1) -* Average case performance O(log n) -* Worst case space complexity O(1) - ----------------------------------------------------------------------------------------------------------------------- - -## Ciphers - -### Caesar -![alt text][caesar]
-In cryptography, a **Caesar cipher**, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques.
-It is **a type of substitution cipher** in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on.
-The method is named after **Julius Caesar**, who used it in his private correspondence.
-The encryption step performed by a Caesar cipher is often incorporated as part of more complex schemes, such as the Vigenère cipher, and still has modern application in the ROT13 system. As with all single-alphabet substitution ciphers, the Caesar cipher is easily broken and in modern practice offers essentially no communication security. -###### Source: [Wikipedia](https://en.wikipedia.org/wiki/Caesar_cipher) - - - - - -[bubble-toptal]: https://www.toptal.com/developers/sorting-algorithms/bubble-sort -[bubble-wiki]: https://en.wikipedia.org/wiki/Bubble_sort -[bubble-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/8/83/Bubblesort-edited-color.svg/220px-Bubblesort-edited-color.svg.png "Bubble Sort" - -[insertion-toptal]: https://www.toptal.com/developers/sorting-algorithms/insertion-sort -[insertion-wiki]: https://en.wikipedia.org/wiki/Insertion_sort -[insertion-image]: https://upload.wikimedia.org/wikipedia/commons/7/7e/Insertionsort-edited.png "Insertion Sort" - -[quick-toptal]: https://www.toptal.com/developers/sorting-algorithms/quick-sort -[quick-wiki]: https://en.wikipedia.org/wiki/Quicksort -[quick-image]: https://upload.wikimedia.org/wikipedia/commons/6/6a/Sorting_quicksort_anim.gif "Quick Sort" - -[merge-toptal]: https://www.toptal.com/developers/sorting-algorithms/merge-sort -[merge-wiki]: https://en.wikipedia.org/wiki/Merge_sort -[merge-image]: https://upload.wikimedia.org/wikipedia/commons/c/cc/Merge-sort-example-300px.gif "Merge Sort" - -[selection-toptal]: https://www.toptal.com/developers/sorting-algorithms/selection-sort -[selection-wiki]: https://en.wikipedia.org/wiki/Selection_sort -[selection-image]: https://upload.wikimedia.org/wikipedia/commons/thumb/b/b0/Selection_sort_animation.gif/250px-Selection_sort_animation.gif "Selection Sort Sort" - -[shell-toptal]: https://www.toptal.com/developers/sorting-algorithms/shell-sort -[shell-wiki]: https://en.wikipedia.org/wiki/Shellsort -[shell-image]: https://upload.wikimedia.org/wikipedia/commons/d/d8/Sorting_shellsort_anim.gif "Shell Sort" - -[linear-wiki]: https://en.wikipedia.org/wiki/Linear_search -[linear-image]: http://www.tutorialspoint.com/data_structures_algorithms/images/linear_search.gif - -[binary-wiki]: https://en.wikipedia.org/wiki/Binary_search_algorithm -[binary-image]: https://upload.wikimedia.org/wikipedia/commons/f/f7/Binary_search_into_array.png - - -[caesar]: https://upload.wikimedia.org/wikipedia/commons/4/4a/Caesar_cipher_left_shift_of_3.svg diff --git a/Shortest_Path/Floyd-Warshall/a.out b/Shortest_Path/Floyd-Warshall/a.out deleted file mode 100755 index 162a7202c3524a91bb5bbb22b6a15d741f901308..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 13584 zcmeHOe{5UVb-pBJTZtV?a_vNp8=Fy`)=n!{lx0m$u!NLE`6-ZXRg#k|jq^m2l*NV; z1@h66gJzW>D+{5jbF*ep(*!fNVF-qz&4#pa(;}8^FLJQ}Q#+&$wyZGPBp?%aa9c0a zQYYMZ?z@M4d?F1m!~Pj`g~xNxch5QZ-t*r5_1@7}f<0YMheL33ihBfclhu9+nZH7u zY?Q3R+QbdQFSd!TVl9w0xcst&sF`EBtV}blR&p-TDqL+&6KHe#Wrpb|O;|AH780fU zipj6CCf!kIvP^~WNPzUHt;@Gb7IaW%m_DW2F;9(>$s>OWCcXM?k_8=<8KxIi!mes=3ae|zwyzna{;naXa$#rI8!T0EwkB<2QA?n(XmI_K>l zUb$gs@b#X}a~nDURZP?#Pnpu~74TmH-&jW8j|P>)cUQtI*gseSZ>V7B=?d*}SCBtm zLH_v)`0s(&i7jH%Gl(3Xci5%$0xs(BxS9_LqZGqMc&!buf*#p9b^9PnQLgL=JTECD z68`LG=^1Gix_)FdF{Y=CP}0zKq2G5@?~5LZrHp8@BOXenqA8(w5A4??(WHV0_IJb+ zW6^=oP&{gul`nbdK)=xzOQiInP%7HeJr*-MeZiwb2cC$hg1udR{fT}(D1lfq73_-@ zvlGbn8!geXNW44TZ}@!Skx)`MlA)N9>JA5keZY3ZZY-=PQbsZw8top?2b%O?e=GX1 zvgQu6=6+*$I5uY54kyxv6s5*YkXyp+5jZ3Ks2(19R38q-;&4%TBBY0m=tK+}I!P*j zjfP-tUr%>?hu-XMDdd{Hd(8ZU59+&to5_iBMx%+wozwP5Er|=i1?Rb(aLt0lA%)ay!EY>} zLOf`}*IV#G3%Zc_3$5>K}&H!gW6@#MPPpyWTe1w6Sd*DLwo5>Kwm`N8{s-JSW#BU-{3T4}w>QYqoa^ar#f-s6$#KJx|)yvRli%eRS(-Sd;Fl zJA8%;@)sd|fBf%ls=;en>n1@6y1+M=lu9GMBZ5?7f=fRqZDq8Ji2%*0Z&m z?XY9kKlz8pwsJC9MJBEfGes#?-Ajj`yO=oJcLC~h|73nqa{TcKM#(qNz`K80T z$Du=cE%QV+lYVP4c!kRyOfaiC&cd`dr_F4Tnd{WJN*YyXHOIpLpc+=%yHGRx zEwto1RcALiuT!$nmzIyym)T8gXM)tm%%+8@;8jQNJ0IoqQ^93N?rE91;>aCE=H%gX zbbI=>u{=-GsFoo}yy6L;v28>Z-u5IIjws=C?pq@-g3y$2wc!Z~-mtbJO17VocXD=`T$K5lmRZb3=x)xKqNr5MJR`LV z9je2)vv=s-56X1tb%15s9=>qxMqkioo|E3r-bOXeX?xGrd;_jD{2$Ahx^?LP$83yw z>*?OnI-RXSuU?^@Ao*$|nA|^Mz?f6q%;9WA+xx70k?q*?stA;DNyXflNMdC@|17d&kW+9!&PLjoU!`yEE^1XI}UHYtOE? z<*K^yp)315+MrGU+StbHLr>=2p3M85u#n&MrZ#oXq3wMy{VpxIUpyRmIB+=dNI*Y# zvRLEq&fz}M8m*RO+D|#Qy6)~pOKH)Iqk`u^KZmZwK^x$;w?OIProHk;bm4QLv^MsD zMnTV`{L7$m@RvYe0;Tg3CCB4^!ZA_n*t%g|^-0INTEgj!d>ZxKNdhXBmlt9O%1Qph zf9CV^BFl^^Z5Jw5lYv9^Y?%j8*m_s({=2Xc^acUMdQwxAzPutS@p)wJq?RS&FsVATVw9$59jss~m*uN|ng4Ub-?8l#{Y>50cNBeJ(Y1IlL+NHkKdor1qFsvKujsI%M-`RI zmY;nc9d~(l9vVuI8EMZRZ?o6e*xa0!Z1XM?@H991_V}87O`=4&#k<$r+~{jEg?+wV z9*GFyO&uFGLPMZN(xfAti;dy?;<)gRC5)&y(B9o>gpMfg$XMDtl#bzpb}S;i#Epbf zBf=XwHU@hpHIin@(P%OiON^B;I?9sKc!(5KZai)XZwwzGg%=<3@H-3!Wr;}02nla= zL?2FuMx**j1iH+b8hR+13>`ByIRB+E#9%!%8VjT91PtQGD{C<=4y97U8%~UlM#l_` zk1J(e7~O47|B7N4M#Df^+$D^%cvWGXT8+6dYI%H?;%o7R$!~>Z-X+$Fa?ihuW(75F ztV%AtVdL>vir-imr=|G%!hBVVZxHk9`7Xt8D#XE*;%>q7Tq#~7de!__iq{H`-zdfF z#0zERHx}m2Qu$95=F3uilc3K|_T<8>S8jZ}#La@g(^_?0G|Q>^uoSNs<7M$;yg;cu z&+bK(rqwF(8~H(`hzddLhy!om?Cq!Z!-+4&FWTk}ufi|e@PNYY>(~R*{uc3K!yt0S z^=w$?SNd}nIMvJRBk553CN2je9(X;IAbw8cD%Y=nl=52yz09UW{ipOVxXAvnT6g6; zPhdAffN)-qdA%aNa`x$6r2~-`o;p7yim6@VEB#3lsH{Tge+0@JrIp z%JKVKiCZn0`CHHcigU52)(Uv9!s+{kHKl=jtbodY9e5q0nRwo)QuwI~@-G9gE#uEc z;0^HG57cwT`=57!lRuBD{hfSQk2)OK0M$9`3-LbOH2Th1E`Dc+lBX{;*5m_D_UUsy zrKtSHYkc6fmUtosi~Ulbxgw2Kz>inJ=al`^4TD7^$UR>{{)ZLte^&Uo?S5^=jUYcy zdP?m#0H^*^TmmKeZ3FZ(5-+p9gp)?fNDmKt!-(OzucJ@z>Fysu#8WY_NjFCIFoiay z1V=PkAYG3n^ds@aP$;fPj6^b}htd-Qi~M*zYD6R6KiJdS2FqoHblPs1n+F{mg5)t_ zZZ{(7(a~d2v2Z%=Qc6YRiDMD{u~0HK5{k#Y;qh@9zSPsE>#>B~)94Si_;dEUq`^2+}~9Q11npJ8U9A$T&fuHTolD+4gIo} ztPC=v@HU(EYevo;M2{k|F+H7%!c`>7k6meqonGQ9MAi9P#?qtFByM*+HcAn3vEc5} z(1Z-GyT;9gRlb!JTt@+Lw&v=QR6-xYLqm~$W}q9n-+at;>}m`5pfp6T=$aN8QfG$q z*^H~WzX=)aQM4%}x+EqVxh@j1WRPNekFrV31IivjVe(0Qyr3`xsGx7eO zM#Pax9$xUeJ?^!c13BjSMb z`vqiWQs$Tyk03{9d#<0)GjFajMH-Z(Vhi=K{G%wRcLmIgwSH4Wz3}K&`oxk9w_m~H zab(D+tk378UZt-oL9Umo&t>yUf8HvLe68Y{egnK!pZANCs-b7OVKzO*if3*5e9r4sL8AO#hvn_< zKc)0}&&d0_UZroBXP)T`N}ul^pBo31{s333DC;r&eVaa?FJDmlU$#B4eE(Q~9vL?- z8UvJgpU?jvzoL88601I+ zyT?7I3b&IDupaXtAVV1UpZBkm9#ewX0h1F#!ORLepi})#1;os-exD5|SxQXl-*32X zS)hJ?>M=7se{dP=S$Tf;86$e}c9WY_^T2Ijsg2x!p1){(maBhom#N=q8!-0z{~L$B BcU1rY diff --git a/Shortest_Path/Floyd-Warshall/floyd_warshall.cpp b/Shortest_Path/Floyd-Warshall/floyd_warshall.cpp deleted file mode 100644 index 24e6cb3a2..000000000 --- a/Shortest_Path/Floyd-Warshall/floyd_warshall.cpp +++ /dev/null @@ -1,57 +0,0 @@ -#include -using namespace std; -#define lli long long int -#define infinite numeric_limits::max() -#define Min(a,b) ((a)<(b)?(a):(b)) -#define Max(a,b) ((a)>(b)?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s , i--) -void floydWasrshall(lli G[][400],int V) -{ - int u , v , w; - fr(u,0,V) - { - fr(v,0,V) - { - fr(w,0,V) - { - if(G[v][u]+G[u][w] < G[v][w]) - G[v][w] = G[v][u]+G[u][w] ; - } - } - } -} -int main(void) -{ - int test,v,e,a,b,i,j; - lli wt; - cin>>v>>e; - int ed = 0; - lli graph[400][400]; - int temp = e ; - fr(i,0,v) - { - fr(j,0,v) - { - graph[i][j] = infinite ; - if(i==j) - graph[i][j] = 0; - } - } - while(e--) - { - cin>>a>>b>>wt; - graph[a-1][b-1] = wt; - } - lli q ; - cin>>q; - floydWasrshall(graph,v); - while(q--) - { - cin>>a>>b; - if(graph[a-1][b-1] == infinite ) - graph[a-1][b-1] = -1 ; - cout<hFD? z@AG{B=+T_D_u6Z%z4qE`uf5OShcnx~OBdM;Ls^$i%~O&aSRp8VSE{?iqEMFaWx-RXXbU<_F?PT-{LQjy#4KBdBrG^eqm>0M4GCFa;;Jx{8pej} ztOXTx}o%8WWA7FX@ zsJ8v>4*Qnal|E5>?Cz>alw~>iv-(XbC)_k&aD#!T{OC;sY-9iR(ZGq`-!2_` z%b*27^?Q{=(2zb#DaX|ZeoR03*MaX#PIEu@?*l_)#=g z7d-oH`c9eh`x}~DBK~MB&=&LimA`tke?_Pv9F2wA7BmH-(NI+Rt5z=a*M-_l^vY!m znpz^Em4S^-AzjvY$py=6W3$37QUAt3G&H>`5{@k_^=?*v;9Hua-kL=#YFldkUO|N0 zqTUr@Bx_^SLy@|ss$gxbv^3ZlX!FO~0^wM+D(LmD0B#zDg@gWY! z)|Nr>-qkJ8)z!wP1;Y`M-4w0*a&m(!A$5koW=T-%6l`gaNfp#QOdAF*^TBe#P5xlx zCVzb(+yr|DI|BYdEYuN>spddaQwv1+$za;JIRIrAFRhxtz(3V9J)WBCnW58b*ZQXc zuapi1HjG;Sr}JsRCjMi`8pwOmw;Wd`_{$H6vpM3wX5!jMga>lu?=kz|00)z#=M|fD zJwm8W?K8_yjoBc0#x^q)N#62D&IODU)@At@@wpZfu)y@+0Z5yorPP&#PnJJ132((% zGL$6YljosXN%-VAT#TV= z!ZVIqmv84uhp#LBoikj@cjduYdN%`+Z|5_Pr!5K%PtW)@NKTJ?1^2;YDv)Bnk%h;P zp2juq1?Fku<3}X_6!SFg@q?28Df4#b4@mw2=4s;N`z8Ma=4smFdnEr|=4sO7J0yQA z^EBo0R>@z_Jg42`8zldA=4ra)HIl!A`Ap_3B!4OMG~w|Q1b zW@XjkgGVsq`VJr3AmH#@c@?UA4G2G~A3SEEQjcB-1FrJ9uLkh#JeA|?d}s5>M#Jh-87d}lZ)qAY`6D(ilyZo;r;LsO#2=H~j?>p3euFrVR_wpC9p>b(h zmbAfRAV=4~_wGGoh zf4VOLV^almdAohL_zoRK8xMEerSvHg)mh^>?EQ%5>GFP5?mfA!P|#f!j;>W7`GUXp z9r}~qXB_bzCW+eV{m3}+YL9wLe4X36JKK+St~%Pe?9HxKZ+3Z)cD{;QiqJT-5#2tK zcPvR>m$b=;>LIOHxv85?#2piHuOymek{|sy;u7VSxIMkBMLTwX_<3B@zRcZ&>B$0e z95Ok&yeGx1Hk$PwL7H_*yH07V(O&Gvnly`Ey5Xxm=*1ppRj{b9v;C;Hj53XgENM_e zfZVE6Nbb4NasYP3>z(bdba`Lt^d7_AIJonm(dq3*5((pACzS2-zTTzEz1^2pFo|w) zcCG48wxjA2AJaw4&|^RM9r`0Y;CWw{>Z(Ya{nWM$=zt0=Q74l{o&5hT>ZIs;tlay` z;9U>HvZ4il82`wn*>!O#H3HxBMP z7|WEfaQu6^?R0H)uhm>+Yoyanwe7y0-3|^%pbn}Tk4&1o`-lXX7q4xkN!z*Yb2WI^8JM5?r4wI-aG$fw`#D?i+@ZgYG2Vaqlo`wtZaH}OFXI-J_E9Bg z*D_R`?7{Ii!!tzSp+m>V7|*|as)udsr z7)PLs_w(a_=;>9R?H@r1I=mtgm&MHV4s<2P<$y;y)1OEef9mOXIy@ite$MVhW#!&u z+qMWi8fyfEqPz32WT9xv-aF^?X-sV+`YJrE;J(zk54O(dp5(HxyY(NZPd{;t^ERC4 zH^`hY_U!b2Zk)LM2|lK1q7%TIBd2m@EhfPlIMv;q?RV7qy3)o?q&l76?$U$4&ZAYG z&p@@i=~WMQc^^d0@CKAV@9TWZxAQ5Zs`E(YPox1l@9TW|G07tGVcN6#cGuV+<=iTK z#*xRE{;5#><3r!3gHGS1XHboA=RrH>f19v$dXJzg=>M;O%KY&9VebKQba@Yydmr2u zghEHURvmz6A5Pmta{-~lh9G6;+&zjNWRi8|?*XsOX6+)8~CG&!`yJH$z$2eD9BS}uxNVwT;($~u3^4lCfygk0CE z2PF=?PUOhXBxv1;pfz~cDF_hdP%r`o=!&DrA7uwUip1U8Qy;aownElH-_C6ZRqTf# zIY`>ayH-6;IeIMQAj%*l&IbmnlDR8w4?OYo_LxUFd}%$3j6*v6xTc(asOKO^5tYA3 zWK^W>9%M`Kbq*pL)rk=F&@!!%7-BG+236S_H1XhZDx=Bo=vwxmw$}Bq*3!;n6w_Vj zo2ES%%l4BWfp&N3{dJY=wRgj1FlhJ;)%_wEU<*Xx&Q-6Q^TXg>&(qYq zy>G_J?x5Vxr+_;OoUik>?(508>S&kuO>u?yJ|=@|tHES8@=3I8cL#Jkw!2lPfzFpZKc!EcLQN+SJd&hlkOPD=jl8e>bp$MQybz|7 z*yQV4b_#YHBqJPldgjB^r{nXAvvb?$o$aSEHyG^`F5h-a!qDg^UoM1w%0c+k9kA3B z%s$C|jqWwTnK9%E(mu%`*nJ=B!ZJO+)R*Ul$~Bd%D?3kDuBu$QboaQgIb2x$?{;4c zSXOMky~64&Am-=TlmyW2m26|ekDY_#>fu(b2NrJbKFgoM-iZ~AsVZTM!N zXn&6nX6r7jTwi%%!JG@_h)E%9>ur(_*mtJc->_*h(vFj$8wZ~n3mB)fkBaLt2>jzQ`sXFrvo)c|WRx#N zxoojp?X1z|3&FD#2h6;s zAVVv!RLH%3Ue;c-1M4AP)*kaKrabc)Hh#`JQm7L9{3Fb~1KX9nI6v{?T+8d@FHW}* z-eRjDh@biHNYi<1kNt>E=QBaW>uys&Zt(Jwxem}gP8A$)<}yPm*9O5^G1_JFTk8pK zH1j$`1J#{TAt?*L-^^Qj`%F4(@7}5(Pu9|&8j~JN9m!kuzHjCyn&qaL|Ledy$4;$i zk=d`SO;~Tj%_jVs32!pt_f7b)37<3Jt0sKcgrAr&wZ6p*7R+%?T(z-15^HzO@J#iT zx~EQUm+aI@8sVB+QaYowq_jl!AfE1-?V0K>Ez!iKrITEOQIk=Hwyy4*PfQPAXSqg- z3Xh+qPp096#!z%`S`GT}CpaVNi_wNNOEp$KnF&u?kf&7E@6xhaM6AN{wD=&c#9x&?lBr9^PIm4 znD@CLE3QE-OwX*mS-|}J1uS?;z{39#;B_E;re`jiBw+D80lr!Q`)auOpppUp)l*gW zFq;E^j{`ICXK+Ph=!(qG5GS*qxew7g^HsDs>)BV4bmY8|Mym9|6?ak8;I7*Q?0!JN zwa*K?tH<0S&Vv0K1R-xF~2eFARzt$=TSD&W?UXHv>- ziv;Wo2>A9E0sC(e@SO(*eD_xZ?)X^1T|@ESP5R&;%n@+U1p}&BPr#9Z zh499~4#O>Qpy3mkX*2?69Y?S+oX2?ltZFkR)}4}H_}_n`+J`5yw~%+E(Do~E0SAbJFhc4i&53Zq0pfA`Cp!W{s{}uB}_0WNs z0@93OUx6eDQ7W$#Vzf5R)1gTI%^)!HGf-s9Uq|BnwNTZO|2R0D`O6{LHSBv*DY-YG z2F?AAdUCg*5|#gb&>HzOp{FhXAK*?KR?X_9zBi$a=6LLSa&#iE@_&kU8~G<-4%@Ix zDTB0UJd2R^8LV00q=|BCZN@*57+!$+GIyQr`-Mm!N4s;^+t?i=NR_+Bb_*mLuOj^> z{zg6wDm7{_i`LpEQ?b8T=#lhgY-=^K@GgU$VVpT1wdWo-*c#)^%h251a|{kSWAqom$X`cr!PjXIY$x{ZQw);TpM(AuhUe_&j$nc2Bx z@T!u^y;q}bqmRM^av#vSv@v*7Dfc0rag5M))xxdgTV+>yEQn^QT&Zg3btT+reNgq=CxPX;19}ZdnmgGYJ5YU)gM3V4$ zfHQs#kv^DrEEi@B!-Wswwx5IWjJ-B&74}_be+U}oEhuV*Lk(TI3HM7unDY`iGH-|X zW_3g-J{t`yW-#r=0qI*DOJLfLkzlrR)45g}~)=78#olBi`#|K>Dq&q(30w>+^G1oomj!(GE8C)0M ztQ>znjFypc0&35`79(D6%DxZv3@c7QV=^OZ`Wfy&0AyW|rnq)XQTTikL_!Dz!1Kz+On&cSp3W1TqXX8n>^o=lZ=I5~e@QG~r zS!wCvNDO4@m!KmvJ7CA*J89}n2X4c6F$o#lVV%r7FkpvYC51zfAKt~}*^bE$YL6NQ zpoSa@o$O$9bBJaqstqG%@G-}I7Z4+655Zlz{~O*oVh+;|_asOgQNgs+{dM^2h($~n zxJRKmBNj95a(@r^5k96Ty6+@!71Jf|apbLLdX~EyEgi9h=?eF1%2~>^&wU{jAF+(; z)VKpoFK7BI?pD}hL=Dp`+`FLEh!srNy02utE16#DK7oiaVl~sN+~?vx;zFiZyZtcX zh>MtB<8Gpy0Ml#TJ18f}^!e_~DJR7A1@8Z$oCc=Xxyx}M5n+10dmZJpFnyu&T!cX~ z;;U4e&x6^tWj5CtYRdcQoe|qF2X?Z9Pmbu5UrG0-H=$&bGwmbTVUi>5p9E=XXG2it zWl(G6n1{eq!k&5-iP8^|7@#tzAw6ms@!sz^5{IK$SB~DnMV7 zh8v%6MHQu{T}-;_dSJ5UMs75cWSKL-J$fP)&zz01F?!V%z)p5tjr;T)$RWftCOeps zr?f`VI_SFjny?+&vZPv5IRn<#xo=Y3?DYZLD%a2Z#GE_@PcaRc0IIZe&H7AEHr( zB`Y8%>u*TDUi9&=p^3W|tVN$lv)rEoQS=$T!QuWBXo@~(+UY(U6&C%A=>qpnOnzIHP)9dnVPcS!rnz0 zl381J5*imdj2q!<8_F(4BZ@MOTajrjD@NOk1{qYiwd_)$iky;(mCa;ki18LmI?8?x zJ&J}I-$7<9JEvUk|}Q3h9{SC^Gjz&N8DWP8e@)WBoV zrni)hLQpB1BANYVm$IZpGIy6<&P=If4wTVNil!R30z6u_2V#n*i*5(YFukavGUH*? z@Qlj*7zBkC?24(5;@aP%d1Fy9Gp%^F18~-z;4EItUY_*`%vHSpPS7j2jp>!TrzV28 z_`>6`Uz*B%3j&HSdJCDU&T+#cu>Dsc#=RIlGVTnTL%DB9CU> z>yZ&G_lg9Y2Tw$$g%K(?=X;P^ILH2Hq_cU0AZ{*sDiI6{|H2x$pQMY*v(ZC^bM3@( zd&$Jkr?h#3It^yHnI%zEhtBdfWPR2~H{b?WHhn0YIepXo*OF+M z@N@es!EY)!l|J$pQJec>T0urt9fHa^rVERt0j2SBrqFW9RNcQwm22wme4dE|b=C%S~FZ=7ivZh0E>SebY_#9Eae-2WVUF#hFMR zEEYaUBzNW#EmLz&!`%x1VdGAnu5`{JVwM`*w9`$bomKf-_(Nfh44&aw>m`bG7tok$ z%AeV|r)f^lWctI)y4tCZ@f#aa#a5u*nP}DcAPdzwZJ}m0 zzK&^(t1u|WhsZkBIsW2j(JF2nYWhtysY&0&G{)6)pcvo0OVe+@0p(n$YWgi)shad1 zOoRSLV8(BK5Hy+JhrK71^N}PoADuH{NjjP`&ki3O|BfvK`;C(wgK$5Wnz@k3j^9u+ z9*Bx^H>@#!fV7r7n%OtfMxHM)e8%tDhYGpBX?9R16}^G7xZ7zW2NQV{o5HEcY>K{Z83(B$#M>@+Di zRI^#L+*J8z?2(Jax4FqG3{oN9)&OzW|7>uV$tQ39n*lFl$OqAb@@%~z<|i% z_G~KgoD7zKZsVS9>L8Uy&HWsaYW!w#!#STZ-C=M`H(O?4&kox54%+s|M2Z$np-bq1 zo)>W&{|MW~o!>;c9>E?T+;jY6_o0|O!l}jOx55v`za;(1tzs#MX~@*1+fOVj%62m) zV*>3*I)_FmKgkXaN$dH9rAb+$%A0BXQFgi~pSqGBqdb$@KRAhdYMQ* zmZhrd`HUU>>QyM_<65ucpV1EYaC3%_afxE(Ig@hl`vyw5ft^$`pUb$3%Xz1#b6;Eg z9z9Ao)sv6*O}v>1?sscuS-Y0!!$=eN=|u*Mv>QGHH72eTEVsn9J%qvYJ2Ko#3v!n{ zQKD;_zX0u<_y+GJ=MK8AP2@U1gE1#gGzeJCo%JMT=ATP7KjNLG+;C53-bbYt7z8Zl z)_W53f>^VfHQ`F`#Jd-u<0f1sRl5HKUz~6?(`oKvXg#5mX@`3g(_d$Lko$eyC&)U} z>0S%b6RsgX-_0Y^3A>pta9_mqwM>t4{}$dn;X0;W?%NP}CR|U?o#_4zBJ_kCs9cGf z@(?;~!q0eI;CTamGvR4^KaU2od3GQ-<+%censAti=UBoUh6J1Dd7JzPS@cI1@rEMi z%YV-zy%_u#%XmYX9ZRPi@|M3v0*Cb9XdttB13@tfD8cgpTmLs!$CC(M?s21ACVWUF z&m~OcZVdbhzhHlFAyNhrbK3M$^Z19rIA|vK2+{`4dI;U8a%hlAhHV1coWq^Hc^@HA zjR_eH2bq81D(qq|vC40T_~L-U-5Q=*nEsbf|2b|W_HAN$gZ^BFmycvwhMm!j=NdXv zu`e`Lc?65H;(rJ)4?MCtjLo9kS(GiqoQEJf7>MlhHdIi&L_!D;Mufps#zw9cQpCd& zUBo!D5P<`&D*i7i;|WTSvY}M;JyC?mDq4rRD`30g_XS&i3jR{uA&cN&k%FEh<0zY1 zG?-^Qjk*7S#7PPbHzK|lG{78{1FNF1r*NYW+5Ts>`Skp{@B*B$Jz#}4Uc(d$D znrWz=ea&;DY$mj=$_*+~Cv1OXk@$i{aAwgwKKzxRU?1EsR6J@*r79oG$}f>}oS2rOP$zHpZ);ND+^-l8apIx;8O7kGK-^itaTJ z|GjtdZR`pjeQC|uKIJjkUEiZy^E51>j`CE~UI$si1G40jA#B49l*Ti&WNGy*`J6q% zW3(im^54@1*T^KvqqS7y$oMWFL!vR#3?94*zw+$HXe|CVtK%_TqB?WV`54V8mWLo7 z&n4{&#*Nw_7qQ)D!-jx9g+e4N0xI~sPY0jlvl9ESW6!n5t{2WmRE_=W2HQ< zv@Q>EL@k%{%D&1Eu~93eJP7Xr7Il==ldoeUx{q z$m3FNKv`KqQ8yq+{K8eCHGkXD!LzC8i0ivMhI6~}YiM3LFIMQqr62A6SiLd!a`$*Rk} z4jxK+9X!IFY~D472bGzp!9B^v5u8KsnC#&0e`Xbgoi&|^%oS+#SwHYObxWej36&HW5)VPuoSLD_&=H=`PdG5BqAmB34kTo$9? zzfj;b@{D4LSdHUT5#}BMV;RGUq=aWFVNW(Cl$}Mw&B~ai3I7MJFlI}&D$5Dg3XJjw zkhpI}rx@pGqJN-{T%O^Xc$W3+(kUNid7Hvgx@tIg4 z8wKOBQ9-q>H;*dW0$j$v-+;&`)+nGD+urq6w1=5lTYVi`X^bGRZEvGm+|I1)YWBc5 zYSl1JH-)O1#5^uQJ6QLUb`f$j6z*W-IB%1C?YYXPIl0`O9xTa$&Kjp`%JkH z$K~Egx!{?sdDd1%+k(hxX)ARD%v_B$z|1VIJ|hiMJ@E!)(7N*r(Mz;fD62xMm=Uk& zPpk;NG~cv_Px{Hst*w3p!@^idRxt+;*Nkeue^5Lg?+}>MHpQh8>yu8bHsw`spbsr& zfo?k8V%art5o6Vz7zycvv_{k7GFm}e6+kh&+qQRY)y8;u~O-ngCZll?#Y-u>HaE;chuRx9Hn%D3;mV|%qI^)Myb_f}+R ze||)_&$s-*5N(80W<&IVc~*Bs&60LyJf{WSy}kNJb|`w7Bh$Y3!1m=QP1Z+D)+K1~ z3!3O?<(*b3)kUg?E5Qdt3jlU*GOR7>!V0B zy>v+^o~~Jf;br1iF2V3J(`%P76q=d!%SYx{h~%f`t`uX~n>rqCz(eX*xZD>e$vl(9 z*f;(x^rMe0eOD{d!oQt49jKgTlEX5%-y@yKZbt{wDaGJ@mk|U z?9IhmcZYRtUt0^*4QV)h(%1GiJbC&ST%IHy=ih_eWL>=df;8F=5-Tn!LF(sFZ2OuZ zQg@2T%hvIIsqs+o^mfd2#<-lkEPKw#oLpnb04El2w%LZ=F(<1$%Yf4M*~*^73?$A` zOcVf{?uaMxngp=v#0~&086nvrw1UOEL-w4kEG;8*m?^Fb^jUd^Rl=$Ud5m+1>&hZI zbB7a^ovuijGhV=8ArRFfIaPU@1g~V7T-O#>-BNF1FklrpFnUR}_wVoes()r%5}kDUUYXuCq47>#O+rklp6 zO|+)PK*bHJQR6HsS{Qx;Zx9Dy3-H#U&RF~t6J3baLb1xqng?IPTF*>k(l~oCuy9TS zD&$Vcm<7BiZVQxZ15c6OlS;J?C5BNY7AzeL3r+#o)I3AGR3wLbO-l&5%0L$oH+`r< zFoVObEMX$nIr9vYn*_5G`rv%R@=qLu#bu^zf#nH=rRm(brsy?V>l_FZdsgMKqIrov z#qq#UvlSJX>{X>m6Bo6l&5u`*m2l++u&_h7mD(=koa%L&wp=t*2FBu^j2y@n1vkwX zGx*ZuU1kGs6|$y+%vL8lo7p9nJ5=Q{yEIvD52?#~m)xxDTb_lGGGqY$U1%~%Ri0)y ziE0w{Ak<5zqPi6c4vXGwM6Cx-IDL2z6;^uCup}G~5ZM@d=5!f_tMOebX~r5RA~~ZF zXxExa=y$%E#NfWbOrpounMn*GbqnIDP31AJ8=vK5<8E-?;j(2)d$eszI1+4XuM17V zXUL|^P(4uiu${kby7`s6hDf`nnX(Zd0qaR9yi@8z8`~TDD(H_P)Di1R-mAi1oSGir z@S4&P3{L4qKf`JcUPB9C9NmO3mifcYtxcikP$U+JgcgtvqAifM1 zz!%h*jD}(tH@E6!xFHf~(#cp|psm45hFh!@6fu)+;fOAeg`2gcv(FB;MC!v0o<`VT ziE)rbKLnZ@TH3;~#^(Ahb-V*JYpc{o2~GG^ zT$~KDDIpTtLeSb4steVJBcVEfOKVgUp$L_->9LkJpx`W#_U2F7Qc-l@H9}PDkYo^71CXE=-Ovmb=0n!Mj_y;7grcTe@*dA_*xx*1zh@d1)E1&|H z)=G*!G}gb^AGa#Ch}D5k7t!!Kg`P!k=rkJFj23NaX``*t5nF<6kuJn?#b!Nd+6#== zUfX;7V@pb2e{HYhUS&(OXT)%~W$fbJ@q>$(lsJ|+ra0bl{7CNiVk!mc?Mq62^qS+| z+xI)}T~hMcy|3Ln@7;!be*_kTG7MW;?o!m7oO|4HFGS$aHY4AWf9}rLN*{A9+5fJs zFpqzZ$KP?}FDZ45bzJXwfs7g7&ahSG+veuk%JXa$d5)3(bMJM0*nWPAqfm-t8M}5l z9&_xql@3PUc4p+Ac@CG|bCJX@(b2!#!EVUKqIbN`L{M4Sc*3sa2;fi;`eSxhg4`wN}&B$~7 zW|||=-u+|@K zY}wMNzHk@~EeUO{nYk<+@r44d;V?C5Y-`y<($#^cc6@*l+PB3vw%3Cf z(Gp)D>`;PowMQ^SF!)?-85$i4LX}_u6^3J5sXLXaXLDLMhuZ3!AQb}yf1!XvkZcPC zW2jfYdf4k*jMFi!>%90pV)KgHQha=|zA4ZURpF@ia|PQq#2WE&NLXi4b4-__ZT0m~ z90MiRLQC}=_1)N6{%!qCYw3;nn-clE;sVOZ@%Cg>A3o2|2M564GaI`K8 z={kP;5jHll)v=bQCe>`(uYRk-(1fXK@jc5R(_!A4s8f)HV2HLx;@u9T1Yl`4%QOE$1=}Pj(^3%$bw){Yyd5bHOmRe!jk5W;smNdHyYk>z4P?@BCW= zQSF9|J1xx{#Zh71HqI<`QhZyzD}IG9ee-4FDhtBY0Kz4Z9cQW)_ z+hcmVW34j!;Xxq|kM=g$Cx~&mwRt1_;>%VMj#m+D!M8y9*;3AtqFvCxIUv)dVhKhR z13<(djQTM_1~El)z<;@xG{vhCzw^WK{INiTHfej4DlJ7r@p)H9BiILx+ZsU){wf4&(;^)bT0T)mhzF%6UXk4YXmKN!g-d|Xq8oI>0Vo9)eDnHX& zI*oxX7BYu224Iw9R$;r1qZ~m*FOlS1u==~JwFt)@A%u)tKmSz$`d*K?*0wO$G+R0P zFU2Qmse8S4)(d7?OEGKkspgGsY*<@p3t|`7C`rKtwR)RdAqkZu9@Lqz3DH45^nz)d)no0aJlQ{^SAESww723v8K%p z17g-wt)aHImNvzqEm2eVxr9M+HqMgrVPJNI^n0N0;-%<&m?_q>QSqC^vBsA6XdqID zU>0hH(ipM`W$}R5YQ~^g>C{>A$&O9l*wWGzXliW?sLl0exJ8%8(C}tV;t^uuIguEr zOfyV@t0`1Z%d`eC{iFM0E$!$bF?h;HjHi1yt0=$hi;fh{!OUeqy*bf|$r+=XF|Vq6 zi8X!qTxn_O5>9&(Ea*iXA;N%=fOZ7x%y7&3hBGd)@+IO3pJI?{3pX^z%n8JNw)nRb zNM&Mis>}(B?yfrwy-`_rv2NA{r6q}pGqDI!^>9W^TQXD-bgY5a*E3I_4qK*|2V6e% zW0$GPQB;N(dMXr??<@B;1g2qTVz0#7B$|bzRS|P=Bi>=|;e@gobD#7p0wk;bQd38> zcb4TNUdX`MZiGWNg%ICWk1&S9ewH(OF@|2A$Lb@&R#|&RH-%fbP>)&Sih;Ja8ZHme zrTk}X!KM(FVQrXWqY~-*YIB*6o8A>cgx18E;&?|mM8~OK%Lf(3TB(j|a4A^d$_1HB zq<%&X86Q!EKa|V(YiMg}Z{-taL!6QmIgN?tVAS>BXs&$YW0DKdc^G@qcns2$BUZUd zVF9g=ZpCNEn-xp(*yduN$;8Pyu4j&mX&pYSCu&54y0EM-H-;mDwykhW1QTohF8Y{@ zcvxpkT>!nn=9f)JvuO}?i!2F{-5ia_2Lu}~Yjjl%J)CiAV$QN+DDc8$;!_9%5!!w$ zrBf!Cl6{VV=?o3lI?FEsG7;BgO(@Z>Z)U6GYl6+}in?fvUppl-SmjWCy~e~lzl=ci zh89_1@dM?IC|u>Kq|hVlGp=SgTMftfv*MDt7UKSELsOaqLLX?Ff(MMo_Kj02t(~pt6l*G?#xZ$3(~gTkt8E~W zYuZ$F#wAfaHscwG5lEi0wS5p5w*+NCg9TFtp0FGFTvJ*iJ^-=cr8(-tZ3;Eu0mxeO zp=>jwwK-?18RjE>t-qnAMP_odTTOQ9RrI>(oyltP>4s$Es20rdn*=wMRtr-fPp+(xgbj zRjRU9Nebf`K?B1i!j*EpJOsjD(ANmdUs@;q_#rxROyH*&+Oe;~aAf*o@-_=&tb}te z9Wmu1Ov80U*ahOe2I~vptXw+1=ko!lW;_;H6DE3%BZ)Cy?;6M^1WXBxl$cQ^sdFTV z$wtUj)x1eRq@Zi?@1{AW@>xvcQ_r>L0zmr6*ziG%FbBq$Jm!Sa<58CzCY(l`;Gh76)&d)?6lx8%wJHxDtwNs4`BiQ{1nV5O2|V20t#gO#l!v*-05tQ|ZH+*l zhUk4M!M0Zv0k=oSkFvHlFAjnX(gWBcM%8!(%KE-oPx=9>ukUi%v5#+k&#Nc>K(#-kA{ixVyUL7zKPuCkQ%9krhLL8`=2 zk&KeGonKoU*cU!WS>InvX0qeWoTEegqIcqVruxF?s#}Kjg&z|Co?B1(dCK~ZTTgsG zzSpuL86{~uzQ)$qcgO5%n6iHFC7H?2udliKl2f2M`ot%Guc)US{!@qEmtFDo*xr{t z{#Cl3Wp>3E$a`OQg?Fm^xaKcaMp0 zO~F^1_|)(Etr7Xd)seytNXZeXzmoMKm@u@GW+MqDy??{o)PYAJp z`SVA-LUPCZN+v$_Rn=K0er9HcP5WJa50z3P`-)725 zeHHVEz_Z@h3pXT5!S}EFk@HJaPU`ER-6nnN@7tB&4FTFG^;Kjq@a*5z_AWK)Q{Q*| zis1X0_wlqBjkVX;d$^fWy$h!9CW5G-6tw=0y={TJGx4(SY`?SiG&K=p5XEprVU{96wum71i{Ma9V z;;+|F0j3rwemyXyq>nwOKAsr)6N^2y`2YO%#y*b8X!ZZa?Xv9q$r???K3ba)>p=6*jIEMJ3eIHPWlrPS8nj@FlYi6CVQ6|eRLaX8y9KFY0t zz7IjT&)9SK+V976Tf*&9pPu25Nxu`B=v-`s!I|_AV5T-J<#0f@^Gx@*em*mmrT^W} z|Lsp}_Nt+ey^)YSxawU6j_n>(!T&15CjaUSmLr#iKa1abem-I%4wwzb8**YNi@(5>vKkOekvPBgoV~+T)cS6>NiH(1 zG~q?~<2SRd`mN{jiL4Np)qYEVi_U_ZK*MivTY2lby~gCP5h?ikDj;br{Y|vG6bY(o z@$b*5kfQx2zfW>_pWcKPzt#R-z>|NzS>A2(cboh!(|+XVGhizJwZM_YB#-YGI84IS zCtKE)e03s|%x~>0l$iWSl8KRant2P}n8I&8U*Lzp<@z<1PP!~U3w0|J$@N?N6t9^7 zhQbtMk&CV386@`OkNlSXt^JInCckADkjRzV{=0!q=C}4etl!zb$KDnI}AR5HJ{ zKXS`3&GDwCm?^;OKTF<0B=9!9i~-`T=fzXzRzj-1Qu$v35B{Z4oZos5b(mWYsr0G& z*TGBuIR<%I`!dci$^RC3Xk&}t+P^6<`HxaKE~_7``mJ`oi?ZbUt$m(T=GKTsFG6s$ z@)kUi!XMuca%qkZ4dQo;&w?MJB)NX;`MblVSu8y*0T!Q?{}c)0toHABZIGg?T>|32 zW3O{cnP@AkxY5JE4rr)aiQ$ESThuu0jv<&8ThmO$BO?fwtPo(==+|ihHL(f G{r(S(;oz(Q diff --git a/Shortest_Path/dijsktra/dijsktra_implementation.cpp b/Shortest_Path/dijsktra/dijsktra_implementation.cpp deleted file mode 100644 index d2d0025f5..000000000 --- a/Shortest_Path/dijsktra/dijsktra_implementation.cpp +++ /dev/null @@ -1,230 +0,0 @@ -#include -using namespace std; -#define lli long long int -#define infinite 0xffff -#define Min(a,b) ((a)<(b)?(a):(b)) -#define Max(a,b) ((a)>(b)?(a):(b)) -#define fr(i,j,s) for(i = j ; i < s ; i++) -#define ifr(i,j,s) for(i = j ; i >= s , i--) -struct adjListNode -{ - int dest; - int wt; - struct adjListNode *next; -}; -struct adjList -{ - struct adjListNode *head; -}; -struct Graph -{ - int V ; - struct adjList *array; -}; -struct adjListNode * newAdjNode(int dest, int wt) -{ - struct adjListNode *newNode = (struct adjListNode* )malloc(sizeof(struct adjListNode)); - newNode->dest = dest; - newNode->wt = wt; - newNode->next = NULL ; - return newNode; -} -struct Graph* createGraph(int V,int E) -{ - int i ; - struct Graph* G = (struct Graph *)malloc(sizeof(struct Graph)); - G->V = V ; - G->array = (struct adjList*)malloc(E*sizeof(struct adjList)); - fr(i,0,V) - { - G->array[i].head = NULL ; - } - return G ; -} -void addEdge(struct Graph *G,int src, int dest, int wt) -{ - struct adjListNode*temp=newAdjNode(dest,wt); - temp->next=G->array[src].head; - G->array[src].head=temp; - - temp=newAdjNode(src,wt); - temp->next=G->array[dest].head; - G->array[dest].head=temp; -} -struct MinHeapNode -{ - int v; - int dist; -}; -struct MinHeap -{ - int size; - int capacity; - int *pos; - struct MinHeapNode **array; -}; -struct MinHeapNode* newMinHeapNode(int v, int dist) -{ - struct MinHeapNode* minHeapNode = - (struct MinHeapNode*) malloc(sizeof(struct MinHeapNode)); - minHeapNode->v = v; - minHeapNode->dist = dist; - return minHeapNode; -} -struct MinHeap* createMinHeap(int capacity) -{ - struct MinHeap* minHeap = - (struct MinHeap*) malloc(sizeof(struct MinHeap)); - minHeap->pos = (int *)malloc(capacity * sizeof(int)); - minHeap->size = 0; - minHeap->capacity = capacity; - minHeap->array = - (struct MinHeapNode**) malloc(capacity * sizeof(struct MinHeapNode*)); - return minHeap; -} -void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) -{ - struct MinHeapNode* t = *a; - *a = *b; - *b = t; -} -void minHeapify(struct MinHeap* minHeap, int idx) -{ - int smallest, left, right; - smallest = idx; - left = 2 * idx + 1; - right = 2 * idx + 2; - - if (left < minHeap->size && - minHeap->array[left]->dist < minHeap->array[smallest]->dist ) - smallest = left; - - if (right < minHeap->size && - minHeap->array[right]->dist < minHeap->array[smallest]->dist ) - smallest = right; - - if (smallest != idx) - { - MinHeapNode *smallestNode = minHeap->array[smallest]; - MinHeapNode *idxNode = minHeap->array[idx]; - - minHeap->pos[smallestNode->v] = idx; - minHeap->pos[idxNode->v] = smallest; - - swapMinHeapNode(&minHeap->array[smallest], &minHeap->array[idx]); - - minHeapify(minHeap, smallest); - } -} - -int isEmpty(struct MinHeap* minHeap) -{ - return minHeap->size == 0; -} - -struct MinHeapNode* extractMin(struct MinHeap* minHeap) -{ - if (isEmpty(minHeap)) - return NULL; - - struct MinHeapNode* root = minHeap->array[0]; - - struct MinHeapNode* lastNode = minHeap->array[minHeap->size - 1]; - minHeap->array[0] = lastNode; - - minHeap->pos[root->v] = minHeap->size-1; - minHeap->pos[lastNode->v] = 0; - - --minHeap->size; - minHeapify(minHeap, 0); - - return root; -} - -void decreaseKey(struct MinHeap* minHeap, int v, int dist) -{ - int i = minHeap->pos[v]; - - minHeap->array[i]->dist = dist; - - while (i && minHeap->array[i]->dist < minHeap->array[(i - 1) / 2]->dist) - { - minHeap->pos[minHeap->array[i]->v] = (i-1)/2; - minHeap->pos[minHeap->array[(i-1)/2]->v] = i; - swapMinHeapNode(&minHeap->array[i], &minHeap->array[(i - 1) / 2]); - i = (i - 1) / 2; - } -} - -bool isInMinHeap(struct MinHeap *minHeap, int v) -{ - if (minHeap->pos[v] < minHeap->size) - return true; - return false; -} -void printarr(int dist[], int v , int src) -{ - int i ; - fr(i,0,v) - { - if(i==src) - continue; - if(dist[i] == infinite) - dist[i] = -1 ; - cout<V; - int dist[V]; - struct MinHeap * minHeap = createMinHeap(V); - fr(i,0,V) - { - dist[i] = infinite ; - minHeap->array[i] = newMinHeapNode(i,dist[i]); - minHeap->pos[i] = i ; - } - minHeap->array[src] = newMinHeapNode(src,dist[src]) ; - minHeap->pos[src] = src ; - dist[src] = 0 ; - decreaseKey(minHeap,src,dist[src]); - minHeap->size = V ; - while(!isEmpty(minHeap)) - { - struct MinHeapNode* minHeapNode = extractMin(minHeap); - int u = minHeapNode->v; - struct adjListNode* pCrawl = G->array[u].head; - while (pCrawl != NULL) - { - int v = pCrawl->dest; - if (isInMinHeap(minHeap, v) && dist[u] != INT_MAX && pCrawl->wt + dist[u] < dist[v]) - { - dist[v] = dist[u] + pCrawl->wt; - decreaseKey(minHeap, v, dist[v]); - } - pCrawl = pCrawl->next; - } - } - printarr(dist,V,src); -} -int main(void) -{ - int test,v,e,a,b,wt; - cin>>test; - while(test--) - { - cin>>v>>e; - struct Graph* G = createGraph(v,e); - while(e--) - { - cin>>a>>b>>wt; - addEdge(G,a-1,b-1,wt); - } - cin>>a; - dijsktra(G,a-1); - } - return 0; -} \ No newline at end of file diff --git a/binaryIndexedTree/Reference.txt b/binaryIndexedTree/Reference.txt deleted file mode 100644 index e7a6004fd..000000000 --- a/binaryIndexedTree/Reference.txt +++ /dev/null @@ -1,3 +0,0 @@ -Here are some websites/blogs which inspired and motivated this concept in me. -https://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/ -http://zobayer.blogspot.in/2013/11/various-usage-of-bit.html diff --git a/binaryIndexedTree/SPOJ_ctrick.cpp b/binaryIndexedTree/SPOJ_ctrick.cpp deleted file mode 100644 index 54660c92a..000000000 --- a/binaryIndexedTree/SPOJ_ctrick.cpp +++ /dev/null @@ -1,116 +0,0 @@ -#include -#include -#include -#include -#include -using namespace std; -#define lli long long int -#define Min(a,b) (a 0){ - sum += T[index] ; - index = index - (index&(-1*index)); - } - return sum ; -} -void update(lli T[] , lli n , lli index , lli value ){ - index++; - while(index <= n){ - T[index] += value ; - index = index + (index&(-1*index)); - } -} -lli * binary_indexed_tree(lli n){ - lli i ; - lli* T =(lli *) malloc(sizeof(lli)*200002) ; - for(i = 1 ; i <= n+1 ; i++) - { - T[i] = 0 ; - } - for(i = 0 ; i < n ; i++) - { - update(T,n,i,1) ; - } - return T ; -} -void renew(lli* T,lli n) -{ - lli i ; - for(i = 1 ; i <= n+1 ; i++) - { - T[i] = 0 ; - } - for(i = 0 ; i < n ; i++) - { - update(T,n,i,1) ; - } -} - -lli modified_binary_search(lli * T, lli val, lli start , lli end) -{ - lli mid = (start+end)/2 ; - lli mid_sum = sum(T,mid) ; - if((mid_sum == val)&&(hash_array_mod[mid+1] == 0)) - return mid; - else if( (mid_sum > val) || ((mid_sum == val)&&(hash_array_mod[mid+1] != 0)) ) - { - return modified_binary_search(T,val,start,mid-1); - } - else - { - return modified_binary_search(T,val,mid+1,end); - } -} -int main() { - lli test,n,i,j,ans,current_pos,next_pos_sum,next_pos,count,free_space_total; - lli a[200002]; - cin>>test; - lli* T = binary_indexed_tree(n); - while(test--) - { - cin>>n; - //cin>>query; - if(n == 1) - { - cout<<"1"< -#include -#include -#include -#include -using namespace std; -#define lli long long int -#define Min(a,b) (a s ; i--) - -//lli sum( lli index) : returns of arr[index]+arr[index-1]..arr[0] - -//void update( lli n , lli index , lli value ) : adds v to arr[index] - - -lli T[100002]={0} ; -lli sum(lli index){ - lli sum = 0; - index+=1; - while(index > 0){ - sum += T[index] ; - index = index - (index&(-1*index)); - } - return sum ; -} -void update(lli n , lli index , lli value ){ - index++; - while(index <= n){ - T[index] += value ; - index = index + (index&(-1*index)); - } -} -void binary_indexed_tree(lli *a, lli n){ - lli i ; - for(i = 1 ; i <= n+1 ; i++) - { - T[i] = 0 ; - } - //To be Uncommented as per the need - /*for(i = 0 ; i < n ; i++) - { - update(n,i,a[i]) ; - }*/ -} -int main() { - lli test,n,i,j,inversions,position,option,ans,p,q,v; - lli arr[100002]; - lli brr[100002]; - cin>>test; - while(test--) - { - inversions = 0; - cin>>n; - fr(i,0,n) - { - cin>>arr[i]; - brr[i] = arr[i] ; - } - sort(brr,brr+n); - fr(i,0,n) - { - position = ( lli )(lower_bound(brr,brr+n,arr[i])-brr); - arr[i] = position+1 ; - } - binary_indexed_tree(arr,n); - ufr(i,n-1,-1) - { - inversions += sum(arr[i]-1); - update(n,arr[i],1); - } - cout< -#include -#include -#include -#include -using namespace std; -#define lli long long int -#define Min(a,b) (a 0){ - sum += T[index] ; - index = index - (index&(-1*index)); - } - return sum ; -} -void update(lli n , lli index , lli value ){ - index++; - while(index <= n){ - T[index] += value ; - index = index + (index&(-1*index)); - } -} -lli * binary_indexed_tree(lli *a, lli n){ - lli i ; - for(i = 1 ; i <= n+1 ; i++) - { - T[i] = 0 ; - } - for(i = 0 ; i < n ; i++) - { - update(n,i,a[i]) ; - } - return T ; -} -int main() { - lli test,n,i,j,query,option,ans,p,q,v; - lli arr[200002]; - cin>>test; - while(test--) - { - cin>>n; - cin>>query; - fr(i,0,n) - { - arr[i] = 0; - } - binary_indexed_tree(arr,n); - while(query--) - { - cin>>option>>p>>q ; - p--; - q--; - if(option == 0) - { - cin>>v; - update(n,p,v); - if(q != n-1) - update(n,q+1,-1*v); - } - else - { - if(p == 0) - ans = sum(q); - else - ans = sum(q)-sum(p-1) ; - cout< -#include -#include -#include -#include -using namespace std; -#define lli long long int -#define Min(a,b) (a 0){ - sum += T[index] ; - index = index - (index&(-1*index)); - } - return sum ; -} -void update(lli T[] , lli n , lli index , lli value ){ - index++; - while(index <= n){ - T[index] += value ; - index = index + (index&(-1*index)); - } -} -lli * binary_indexed_tree(lli n){ - lli i ; - lli* T =(lli *) malloc(sizeof(lli)*200002) ; - for(i = 1 ; i <= n+1 ; i++) - { - T[i] = 0 ; - } - // for(i = 0 ; i < n ; i++) - // { - // update(T,n,i,a[i]) ; - // } - return T ; -} -int main() { - lli test,n,i,j,query,option,ans,p,q,v; - lli arr[200002]; - cin>>test; - while(test--) - { - cin>>n; - cin>>query; - fr(i,0,n) - { - arr[i] = 0; - } - lli* T1 = binary_indexed_tree(n); - lli* T2 = binary_indexed_tree(n); - while(query--) - { - cin>>option>>p>>q ; - p--; - q--; - if(option == 0) - { - cin>>v; - update(T1,n,p,v); - update(T1,n,q+1,-v); - update(T2,n,p,v*(p-1)); - update(T2,n,q+1,-v*q); - } - else - { - ans = sum(T1,q)*q-sum(T2,q)-sum(T1,p-1)*(p-1)+sum(T2,p-1) ; - cout< -using namespace std; -const int inf=0x3fffffff; -#define Min(a,b) (a>test ; - while(test--) - { - cin>>a; - cin>>b; - cin>>z; - cin>>x; - cin>>c; - lena = strlen(a) ; - lenb = strlen(b) ; - if((lena-lenb)*z > c || (lenb-lena)*z > c ) - { - cout<<"-1\n"; - continue ; - } - if( (z == 0) ) - { - cout<<"0\n" ; - continue ; - } - if( (x == 0) ) - { - cout< c) - previous_dp[i] = inf ; - else - previous_dp[i] = i*z ; - } - fr(i,1,lena+1) - { - alpha = Max((i-c),0) ; - if( alpha > 0) - { - current_dp[alpha-1] = inf ; - } - alpha -= 1 ; - temp = Min((i+c+1),(lenb+1)); - fr(j,alpha+1,temp) - { - if(j == 0) - { - current_dp[j] = i*z ; - } - else - { - current_dp[j] = Min(Min(previous_dp[j] + z , current_dp[j-1] + z ) , previous_dp[j-1]+(a[i-1] == b[j-1] ? 0 : x)); - } - } - fr(j,alpha,temp) - { - previous_dp[j] = current_dp[j] ; - } - } - if(current_dp[lenb] > c) - cout<<"-1\n"; - else - cout< -using namespace std; -#define Min(a,b) (a>test ; - while(test--) - { - cin>>a; - cin>>b; - lena = strlen(a) ; - lenb = strlen(b) ; - dp[lena+1][lenb+1]; - fr(i,0,lena+1) - { - fr(j,0,lenb+1) - { - if( i == 0 ) - { - dp[i][j] = j ; - } - else if( j == 0 ) - { - dp[i][j] = i ; - } - else - { - dp[i][j]=Min(Min(dp[i-1][j]+1,dp[i][j-1]+1),dp[i-1][j-1]+(a[i-1]==b[j-1]?0:100)); - } - cout<Pnm3MlAO3{oF|H;EH)I$ zk&m7nAgK*mX<1pRvCV-y><@1!umMAspc@J=Lv7j4;tWVJr&x=kO$#Ai1}Sm^H%(JD zO|1RSz4wrhPh=N#!2X%8z<2KX-E+=8_q_Y@?t52X?&{fB<#Gv5RpRr4xC^yG38^di z2FYryO{@|@u}N$cD}dDC7nCJLRgUR`HqEqF%eg_T@oTG6KwDK%W|)3b!GbA!NR;X; zrl8I$def&^rb757Kziis!lxt)Iw&(tzpDKZsd^=#^#~@t`b`S1-!v#QOlQb25>sv; zwT*rQ+U`JA5FGJABBE1XirrBrpEWV)IvCdg*gNss8$fr>V??AK6gt@}ZknOAL^p@MND|S+%|E`#tN= zujwGHTp~aGWePS|z|R1`vy6Ncj+Db6u7I~xus>J9es2Xkhbq{4u7aJt73}P+fS;;h z=bOOSi4EeUe-JtJf9O++<4195)bj&jl(wLp=UaSK3KS0AtzSdK?bIGc%uN4p2ifkv~df4AA&--4DvH<9iB?W!rQ8X17%F0=QK zB2uq4lFC`qy;LIGHAXRuaJUeu$m3>YTxt1-MF87=tv@h|;whKmJn^F7Uf>FKHY#;#U`sucZ-u zTw}R=;;U#RpVar;g%L|xlBZBK$GrJK*#`sIM*ObWOuB|9q+;%Un-pxVe zh##TCxtT?zZTApQA)LD*`8$cH>3VKj@~eq=6aRwbtB9u%&RvlF2X}*~(9NBd{JX@{ z?VUR*`L~FtP|c+!{|50CqPaoI|A=_>Au-o0`R@@=p_&VVZ+g2s|Jq|l{taXNKX3I8 zbYGwD#foTLzcS+?a{bv=K{2}@g6|D`H+Kqg@hb?_VWWZilQF*FG4gL7-*^$$WO&vc zy-Wp*GY~#apg4MsqB0y{{t}fRHcq`G4P3eHh5;jg%eXST*KoaTyms4KU$AxuTk~#) z9aaCyKm5W5zYw`~hoLx|gkwivuGt63^$S_kWgi|OjPbo9S2O?T&?^}GIVmjOI6C(P zbSQ6}y7|Idw}={()!VkiQzPHC&@^pKP4vF|;i8d$S+->M)!U1U#-zfgdV!yl#S_!s zbJM4%y{9K|r=WAet}{Y9uyf*e(awOvj@aeW3LCUzk1A}$ju{G5bzGnQ^+zzDpEyY( zT+8*@pDFaKgifl$ofDGFUj-m5_C9|DS!w%$t6$!ZycF1}#4E@>Rd;CwUE(s$6tknK zW$ug{ZPq3yrgL?d5{2>uRGv`fvRx<-LRLDf{rQH`bi>#IPtIwlu2Qt6`GZiul%fup zzdq|CTYj>2eIku!QFmgO$ERJ!9*I8H3rsah@$12pxN*JuUuPap2;A@ii7FyEtVs+kUc4O>vm6PYBi5+OcjTfbV6Vry*06TG(Tp0fj z5%JXBP*A|Ei~O42ia`RujPd6PcA;3_iK$*>r(|n%BV4Z-RQUr}4evoRd!Ed)F%;w{ z#uOsS9$D_4`YHK7{vEZEctGXgj$w_t&be5*vq$lR75a2|(U&pQ*WE zt4TtqYp9R6U9nc73cB6%HEO)MsLK_tt&z2`8?Gx{IN7Q~ul;k~G9I{sc3zRqJw$!g z?j`OJv937}LWeRL&~oj6l6tn(L_4T`%ocC8G&KJTZZ+lPozu5K-D*OgYGJ)e)sqU{ z^lv{vH~kacO& z`wps|2g&QdhV&O9tpY!JU?FO>tdSEM7OQtq`fu0dY&U+>mw)oZd~RX<$q!w*&zyR4 zVG-@lZMuBx%$S%x48a%2Fg0Hy_A)(v&W3@VRoa(G_Oc6cntdL@my@xY-$M_F9t!0b zLx)2HJyY9Oc>S2%ry4w<{oVQZyYt^~`f<;WH{~jNp@Tct)Be* zov^T2_qs8D4PAXc_ZBU%UpyLmG;}odSjfC~wzz)$;u`gAtjT%_rspRbNexY_MdNC* z8XITf+UVXBgs-$HCQu>mIX;WVJPNuM!TTprAC&$B^dRVapb5}AH1KuMM?vd=QF1-e zCtPDb*Tyv~YtOn?`Us~z^DD4>9|`DGUS5cMQBLwd{MF*(G|75=`#kjzdhhtt+LL1M zJ$vqJxpynUB-4rCF#LQ6Yl;YYd{0+(tX<)rt47tbJPNoKYr*G13*{%MROz1v?L+x` zdwH)aC)?k|uNUPpDsT7rzFyVtsei`ZdMZR0Bsd4g$ATgcNG z@@#MS_#p@Rc2BL0%T1_{!45sdET`oNEJt8D0?QFtj=*vRmLsqnf#nD+M_@Su|KB5! z#(PsrS3QdMYF>i4&|aF7lhU^UN^2Am(<_5Aw^s85cR(O!|#FK;iVh@P(s5-EK19jsQo`X-2dZk6Ks-THa$AHP$thb|?#=TupF z#cMm2@J@je?-gscKJS9Tn7d_bu@&+bK(rqyckbNMQ} zh^lqOg|~K2|7rcG5^Kc`$Gj2HxX-a(g*5J5#~udm!fN!w))Ei(FOBCEaH^Nr zN7AA64g6d<`M~R$1aY~DU%7U@D&;o_dRY-_&S_^8g%rZpH`56w}SmO zZh9758vhNz*HzUQ&i$}!+XydnzUL3LJbjz7r*17zUpOiGcBv=E!@%i2(&u|h@?Aes ziA$*D@(;j$sFyy++tZ5`RnGbgKnLXY812_>?JoscOwa?7P!d5mDh@{i<2vbj+X~t9XVaI%=rzM^o2He_Y(y1hi z4o$&OJe-I>0S@QC!pSI(c;T@u7m<8pJTA=rJ%`#uJy6LFncZe2m&w3AGl~k#eSM(= zU1rz8PC7Ft!=>|D=g_`={arYa6>9J4B8d{eqosg6dnU}zFB}XV=|2hD#UY5EmWYvY+>Ilq|JQ z=iVIFf7_9|-|gU`2rJEePK|L=O9&sifLtqb?P^hjQ@m951id=B+kGAiu- zxo{@YDJP%fvwAaNlA`|Zm_*}DJ z<4pK@hWRFB?E1Wau(ZK@Sx{4_ekbtvu{Y-W&sPPdk~^d?7xP^6UdOOtk3(UwAMGYpfi5l{?l5&UCZ(N zkBeHL-pugGVxq+h`>$#J0>!yg&|!s!N_h~wKJU|JwEnb~W5Vy3nEr)B zpPv&iXh*-rj%fp|$M*ixq0jri0evWx-}A7%)Bg)vpX1NZZG&3>E>_gkssDElef~cH z{{Mi^|3UxT4t?HlUexusIyx-hKQ=p!j0Zm&1C;prp8sFK884^)tI(mUSfBR|wVTLV zvA-y8DgQ$hkc+I(`$XTz)c*-|=@zp-?}zKP{)}!vcLVmH+x1_L`gz~Huo(qNEU&mC z&-gqF?EV+_*M6muW<^a|kLi2B?fSf5O8b=p`>EBJ`11h@$QHMspIcA*mBv_tN2=mA ztQcHr!%p=#77&$T{XPdyvXq#vL!RrF1^V(mzsm6Z!DXyx=XvZfMs#M2;?C=N;8S2} Yt>L(Ft7v?dtAA{V(*KNOz&Y#xZwceRJpcdz From 89200071a59a9e55985820ce3a0adfcc2b55ebf2 Mon Sep 17 00:00:00 2001 From: smitbose Date: Sun, 25 Dec 2016 19:00:46 +0530 Subject: [PATCH 17/32] Created jekyll structure --- .gitignore | 3 ++ Gemfile | 24 +++++++++ Gemfile.lock | 56 ++++++++++++++++++++ _config.yml | 34 ++++++++++++ _posts/2016-12-25-welcome-to-jekyll.markdown | 25 +++++++++ about.md | 15 ++++++ index.md | 6 +++ 7 files changed, 163 insertions(+) create mode 100644 .gitignore create mode 100644 Gemfile create mode 100644 Gemfile.lock create mode 100644 _config.yml create mode 100644 _posts/2016-12-25-welcome-to-jekyll.markdown create mode 100644 about.md create mode 100644 index.md diff --git a/.gitignore b/.gitignore new file mode 100644 index 000000000..45c150536 --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +_site +.sass-cache +.jekyll-metadata diff --git a/Gemfile b/Gemfile new file mode 100644 index 000000000..5202882a2 --- /dev/null +++ b/Gemfile @@ -0,0 +1,24 @@ +source "https://rubygems.org" +ruby RUBY_VERSION + +# Hello! This is where you manage which Jekyll version is used to run. +# When you want to use a different version, change it below, save the +# file and run `bundle install`. Run Jekyll with `bundle exec`, like so: +# +# bundle exec jekyll serve +# +# This will help ensure the proper Jekyll version is running. +# Happy Jekylling! +gem "jekyll", "3.3.1" + +# This is the default theme for new Jekyll sites. You may change this to anything you like. +gem "minima", "~> 2.0" + +# If you want to use GitHub Pages, remove the "gem "jekyll"" above and +# uncomment the line below. To upgrade, run `bundle update github-pages`. +# gem "github-pages", group: :jekyll_plugins + +# If you have any plugins, put them here! +group :jekyll_plugins do + gem "jekyll-feed", "~> 0.6" +end diff --git a/Gemfile.lock b/Gemfile.lock new file mode 100644 index 000000000..f1c082640 --- /dev/null +++ b/Gemfile.lock @@ -0,0 +1,56 @@ +GEM + remote: https://rubygems.org/ + specs: + addressable (2.5.0) + public_suffix (~> 2.0, >= 2.0.2) + colorator (1.1.0) + ffi (1.9.14) + forwardable-extended (2.6.0) + jekyll (3.3.1) + addressable (~> 2.4) + colorator (~> 1.0) + jekyll-sass-converter (~> 1.0) + jekyll-watch (~> 1.1) + kramdown (~> 1.3) + liquid (~> 3.0) + mercenary (~> 0.3.3) + pathutil (~> 0.9) + rouge (~> 1.7) + safe_yaml (~> 1.0) + jekyll-feed (0.8.0) + jekyll (~> 3.3) + jekyll-sass-converter (1.5.0) + sass (~> 3.4) + jekyll-watch (1.5.0) + listen (~> 3.0, < 3.1) + kramdown (1.13.1) + liquid (3.0.6) + listen (3.0.8) + rb-fsevent (~> 0.9, >= 0.9.4) + rb-inotify (~> 0.9, >= 0.9.7) + mercenary (0.3.6) + minima (2.1.0) + jekyll (~> 3.3) + pathutil (0.14.0) + forwardable-extended (~> 2.6) + public_suffix (2.0.4) + rb-fsevent (0.9.8) + rb-inotify (0.9.7) + ffi (>= 0.5.0) + rouge (1.11.1) + safe_yaml (1.0.4) + sass (3.4.23) + +PLATFORMS + ruby + +DEPENDENCIES + jekyll (= 3.3.1) + jekyll-feed (~> 0.6) + minima (~> 2.0) + +RUBY VERSION + ruby 2.3.3p222 + +BUNDLED WITH + 1.13.6 diff --git a/_config.yml b/_config.yml new file mode 100644 index 000000000..f5df98308 --- /dev/null +++ b/_config.yml @@ -0,0 +1,34 @@ +# Welcome to Jekyll! +# +# This config file is meant for settings that affect your whole blog, values +# which you are expected to set up once and rarely edit after that. If you find +# yourself editing this file very often, consider using Jekyll's data files +# feature for the data you need to update frequently. +# +# For technical reasons, this file is *NOT* reloaded automatically when you use +# 'bundle exec jekyll serve'. If you change this file, please restart the server process. + +# Site settings +# These are used to personalize your new site. If you look in the HTML files, +# you will see them accessed via {{ site.title }}, {{ site.email }}, and so on. +# You can create any custom variable you would like, and they will be accessible +# in the templates via {{ site.myvariable }}. +title: Your awesome title +email: your-email@domain.com +description: > # this means to ignore newlines until "baseurl:" + Write an awesome description for your new site here. You can edit this + line in _config.yml. It will appear in your document head meta (for + Google search results) and in your feed.xml site description. +baseurl: "" # the subpath of your site, e.g. /blog +url: "" # the base hostname & protocol for your site, e.g. http://example.com +twitter_username: jekyllrb +github_username: jekyll + +# Build settings +markdown: kramdown +theme: minima +gems: + - jekyll-feed +exclude: + - Gemfile + - Gemfile.lock diff --git a/_posts/2016-12-25-welcome-to-jekyll.markdown b/_posts/2016-12-25-welcome-to-jekyll.markdown new file mode 100644 index 000000000..9c7eef354 --- /dev/null +++ b/_posts/2016-12-25-welcome-to-jekyll.markdown @@ -0,0 +1,25 @@ +--- +layout: post +title: "Welcome to Jekyll!" +date: 2016-12-25 18:58:43 +0530 +categories: jekyll update +--- +You’ll find this post in your `_posts` directory. Go ahead and edit it and re-build the site to see your changes. You can rebuild the site in many different ways, but the most common way is to run `jekyll serve`, which launches a web server and auto-regenerates your site when a file is updated. + +To add new posts, simply add a file in the `_posts` directory that follows the convention `YYYY-MM-DD-name-of-post.ext` and includes the necessary front matter. Take a look at the source for this post to get an idea about how it works. + +Jekyll also offers powerful support for code snippets: + +{% highlight ruby %} +def print_hi(name) + puts "Hi, #{name}" +end +print_hi('Tom') +#=> prints 'Hi, Tom' to STDOUT. +{% endhighlight %} + +Check out the [Jekyll docs][jekyll-docs] for more info on how to get the most out of Jekyll. File all bugs/feature requests at [Jekyll’s GitHub repo][jekyll-gh]. If you have questions, you can ask them on [Jekyll Talk][jekyll-talk]. + +[jekyll-docs]: http://jekyllrb.com/docs/home +[jekyll-gh]: https://github.com/jekyll/jekyll +[jekyll-talk]: https://talk.jekyllrb.com/ diff --git a/about.md b/about.md new file mode 100644 index 000000000..19d6b978b --- /dev/null +++ b/about.md @@ -0,0 +1,15 @@ +--- +layout: page +title: About +permalink: /about/ +--- + +This is the base Jekyll theme. You can find out more info about customizing your Jekyll theme, as well as basic Jekyll usage documentation at [jekyllrb.com](http://jekyllrb.com/) + +You can find the source code for the Jekyll new theme at: +{% include icon-github.html username="jekyll" %} / +[minima](https://github.com/jekyll/minima) + +You can find the source code for Jekyll at +{% include icon-github.html username="jekyll" %} / +[jekyll](https://github.com/jekyll/jekyll) diff --git a/index.md b/index.md new file mode 100644 index 000000000..1eb5d6724 --- /dev/null +++ b/index.md @@ -0,0 +1,6 @@ +--- +# You don't need to edit this file, it's empty on purpose. +# Edit theme's home layout instead if you wanna make some changes +# See: https://jekyllrb.com/docs/themes/#overriding-theme-defaults +layout: home +--- From 79775bfae4908db30b26d069256867814e153648 Mon Sep 17 00:00:00 2001 From: smitbose Date: Sun, 25 Dec 2016 19:58:24 +0530 Subject: [PATCH 18/32] Added minima structure --- _includes/disqus_comments.html | 20 +++ _includes/footer.html | 46 +++++ _includes/google-analytics.html | 11 ++ _includes/head.html | 16 ++ _includes/header.html | 27 +++ _includes/icon-github.html | 1 + _includes/icon-github.svg | 1 + _includes/icon-twitter.html | 1 + _includes/icon-twitter.svg | 1 + _layouts/default.html | 20 +++ _layouts/home.html | 25 +++ _layouts/page.html | 14 ++ _layouts/post.html | 18 ++ _sass/minima.scss | 43 +++++ _sass/minima/_base.scss | 198 +++++++++++++++++++++ _sass/minima/_layout.scss | 237 +++++++++++++++++++++++++ _sass/minima/_syntax-highlighting.scss | 71 ++++++++ 17 files changed, 750 insertions(+) create mode 100644 _includes/disqus_comments.html create mode 100644 _includes/footer.html create mode 100644 _includes/google-analytics.html create mode 100644 _includes/head.html create mode 100644 _includes/header.html create mode 100644 _includes/icon-github.html create mode 100644 _includes/icon-github.svg create mode 100644 _includes/icon-twitter.html create mode 100644 _includes/icon-twitter.svg create mode 100644 _layouts/default.html create mode 100644 _layouts/home.html create mode 100644 _layouts/page.html create mode 100644 _layouts/post.html create mode 100644 _sass/minima.scss create mode 100644 _sass/minima/_base.scss create mode 100644 _sass/minima/_layout.scss create mode 100644 _sass/minima/_syntax-highlighting.scss diff --git a/_includes/disqus_comments.html b/_includes/disqus_comments.html new file mode 100644 index 000000000..87fa30942 --- /dev/null +++ b/_includes/disqus_comments.html @@ -0,0 +1,20 @@ +{% if page.comments != false and jekyll.environment == "production" %} + +
+ + +{% endif %} diff --git a/_includes/footer.html b/_includes/footer.html new file mode 100644 index 000000000..dc26507ab --- /dev/null +++ b/_includes/footer.html @@ -0,0 +1,46 @@ +
+ +
+ +

{{ site.title | escape }}

+ +
+
+
    +
  • + {% if site.author %} + {{ site.author | escape }} + {% else %} + {{ site.title | escape }} + {% endif %} +
    • + {% if site.email %} +
  • {{ site.email }}
    • + {% endif %} +
+
+ +
+ +
+ +
+

{{ site.description | escape }}

+
+
+ +
+ +
diff --git a/_includes/google-analytics.html b/_includes/google-analytics.html new file mode 100644 index 000000000..eb2a692a5 --- /dev/null +++ b/_includes/google-analytics.html @@ -0,0 +1,11 @@ + + diff --git a/_includes/head.html b/_includes/head.html new file mode 100644 index 000000000..99b698fc8 --- /dev/null +++ b/_includes/head.html @@ -0,0 +1,16 @@ + + + + + + {% if page.title %}{{ page.title | escape }}{% else %}{{ site.title | escape }}{% endif %} + + + + + + + {% if jekyll.environment == 'production' and site.google_analytics %} + {% include google-analytics.html %} + {% endif %} + diff --git a/_includes/header.html b/_includes/header.html new file mode 100644 index 000000000..df0de2527 --- /dev/null +++ b/_includes/header.html @@ -0,0 +1,27 @@ + diff --git a/_includes/icon-github.html b/_includes/icon-github.html new file mode 100644 index 000000000..e501a16b1 --- /dev/null +++ b/_includes/icon-github.html @@ -0,0 +1 @@ +{% include icon-github.svg %}{{ include.username }} diff --git a/_includes/icon-github.svg b/_includes/icon-github.svg new file mode 100644 index 000000000..e6c5f6dfd --- /dev/null +++ b/_includes/icon-github.svg @@ -0,0 +1 @@ + diff --git a/_includes/icon-twitter.html b/_includes/icon-twitter.html new file mode 100644 index 000000000..e623dbd6e --- /dev/null +++ b/_includes/icon-twitter.html @@ -0,0 +1 @@ +{{ include.username }} diff --git a/_includes/icon-twitter.svg b/_includes/icon-twitter.svg new file mode 100644 index 000000000..efc0ecf67 --- /dev/null +++ b/_includes/icon-twitter.svg @@ -0,0 +1 @@ + diff --git a/_layouts/default.html b/_layouts/default.html new file mode 100644 index 000000000..52085bfa2 --- /dev/null +++ b/_layouts/default.html @@ -0,0 +1,20 @@ + + + + {% include head.html %} + + + + {% include header.html %} + +
+
+ {{ content }} +
+
+ + {% include footer.html %} + + + + diff --git a/_layouts/home.html b/_layouts/home.html new file mode 100644 index 000000000..7b15fecec --- /dev/null +++ b/_layouts/home.html @@ -0,0 +1,25 @@ +--- +layout: default +--- + +
+ +

Posts

+ + {{ content }} + +
    + {% for post in site.posts %} +
  • + {{ post.date | date: "%b %-d, %Y" }} + +

    + {{ post.title | escape }} +

    +
    • + {% endfor %} +
+ +

subscribe via RSS

+ +
diff --git a/_layouts/page.html b/_layouts/page.html new file mode 100644 index 000000000..01e4b2a93 --- /dev/null +++ b/_layouts/page.html @@ -0,0 +1,14 @@ +--- +layout: default +--- +
+ +
+

{{ page.title | escape }}

+
+ +
+ {{ content }} +
+ +
diff --git a/_layouts/post.html b/_layouts/post.html new file mode 100644 index 000000000..1d36c2828 --- /dev/null +++ b/_layouts/post.html @@ -0,0 +1,18 @@ +--- +layout: default +--- +
+ +
+

{{ page.title | escape }}

+

{% if page.author %} • {% endif %}

+
+ +
+ {{ content }} +
+ + {% if site.disqus.shortname %} + {% include disqus_comments.html %} + {% endif %} +
diff --git a/_sass/minima.scss b/_sass/minima.scss new file mode 100644 index 000000000..29b37004e --- /dev/null +++ b/_sass/minima.scss @@ -0,0 +1,43 @@ +// Define defaults for each variable. + +$base-font-family: "Helvetica Neue", Helvetica, Arial, sans-serif !default; +$base-font-size: 16px !default; +$base-font-weight: 400 !default; +$small-font-size: $base-font-size * 0.875 !default; +$base-line-height: 1.5 !default; + +$spacing-unit: 30px !default; + +$text-color: #111 !default; +$background-color: #fdfdfd !default; +$brand-color: #2a7ae2 !default; + +$grey-color: #828282 !default; +$grey-color-light: lighten($grey-color, 40%) !default; +$grey-color-dark: darken($grey-color, 25%) !default; + +// Width of the content area +$content-width: 800px !default; + +$on-palm: 600px !default; +$on-laptop: 800px !default; + +// Use media queries like this: +// @include media-query($on-palm) { +// .wrapper { +// padding-right: $spacing-unit / 2; +// padding-left: $spacing-unit / 2; +// } +// } +@mixin media-query($device) { + @media screen and (max-width: $device) { + @content; + } +} + +// Import partials. +@import + "minima/base", + "minima/layout", + "minima/syntax-highlighting" +; diff --git a/_sass/minima/_base.scss b/_sass/minima/_base.scss new file mode 100644 index 000000000..06bc9ae14 --- /dev/null +++ b/_sass/minima/_base.scss @@ -0,0 +1,198 @@ +/** + * Reset some basic elements + */ +body, h1, h2, h3, h4, h5, h6, +p, blockquote, pre, hr, +dl, dd, ol, ul, figure { + margin: 0; + padding: 0; +} + + + +/** + * Basic styling + */ +body { + font: $base-font-weight #{$base-font-size}/#{$base-line-height} $base-font-family; + color: $text-color; + background-color: $background-color; + -webkit-text-size-adjust: 100%; + -webkit-font-feature-settings: "kern" 1; + -moz-font-feature-settings: "kern" 1; + -o-font-feature-settings: "kern" 1; + font-feature-settings: "kern" 1; + font-kerning: normal; +} + + + +/** + * Set `margin-bottom` to maintain vertical rhythm + */ +h1, h2, h3, h4, h5, h6, +p, blockquote, pre, +ul, ol, dl, figure, +%vertical-rhythm { + margin-bottom: $spacing-unit / 2; +} + + + +/** + * Images + */ +img { + max-width: 100%; + vertical-align: middle; +} + + + +/** + * Figures + */ +figure > img { + display: block; +} + +figcaption { + font-size: $small-font-size; +} + + + +/** + * Lists + */ +ul, ol { + margin-left: $spacing-unit; +} + +li { + > ul, + > ol { + margin-bottom: 0; + } +} + + + +/** + * Headings + */ +h1, h2, h3, h4, h5, h6 { + font-weight: $base-font-weight; +} + + + +/** + * Links + */ +a { + color: $brand-color; + text-decoration: none; + + &:visited { + color: darken($brand-color, 15%); + } + + &:hover { + color: $text-color; + text-decoration: underline; + } +} + + + +/** + * Blockquotes + */ +blockquote { + color: $grey-color; + border-left: 4px solid $grey-color-light; + padding-left: $spacing-unit / 2; + font-size: 18px; + letter-spacing: -1px; + font-style: italic; + + > :last-child { + margin-bottom: 0; + } +} + + + +/** + * Code formatting + */ +pre, +code { + font-size: 15px; + border: 1px solid $grey-color-light; + border-radius: 3px; + background-color: #eef; +} + +code { + padding: 1px 5px; +} + +pre { + padding: 8px 12px; + overflow-x: auto; + + > code { + border: 0; + padding-right: 0; + padding-left: 0; + } +} + + + +/** + * Wrapper + */ +.wrapper { + max-width: -webkit-calc(#{$content-width} - (#{$spacing-unit} * 2)); + max-width: calc(#{$content-width} - (#{$spacing-unit} * 2)); + margin-right: auto; + margin-left: auto; + padding-right: $spacing-unit; + padding-left: $spacing-unit; + @extend %clearfix; + + @include media-query($on-laptop) { + max-width: -webkit-calc(#{$content-width} - (#{$spacing-unit})); + max-width: calc(#{$content-width} - (#{$spacing-unit})); + padding-right: $spacing-unit / 2; + padding-left: $spacing-unit / 2; + } +} + + + +/** + * Clearfix + */ +%clearfix:after { + content: ""; + display: table; + clear: both; +} + + + +/** + * Icons + */ +.icon > svg { + display: inline-block; + vertical-align: middle; + + path { + fill: $grey-color; + } +} diff --git a/_sass/minima/_layout.scss b/_sass/minima/_layout.scss new file mode 100644 index 000000000..11b04583a --- /dev/null +++ b/_sass/minima/_layout.scss @@ -0,0 +1,237 @@ +/** + * Site header + */ +.site-header { + border-top: 5px solid $grey-color-dark; + border-bottom: 1px solid $grey-color-light; + min-height: 56px; + + // Positioning context for the mobile navigation icon + position: relative; +} + +.site-title { + font-size: 26px; + font-weight: 300; + line-height: 56px; + letter-spacing: -1px; + margin-bottom: 0; + float: left; + + &, + &:visited { + color: $grey-color-dark; + } +} + +.site-nav { + float: right; + line-height: 56px; + + .menu-icon { + display: none; + } + + .page-link { + color: $text-color; + line-height: $base-line-height; + + // Gaps between nav items, but not on the last one + &:not(:last-child) { + margin-right: 20px; + } + } + + @include media-query($on-palm) { + position: absolute; + top: 9px; + right: $spacing-unit / 2; + background-color: $background-color; + border: 1px solid $grey-color-light; + border-radius: 5px; + text-align: right; + + .menu-icon { + display: block; + float: right; + width: 36px; + height: 26px; + line-height: 0; + padding-top: 10px; + text-align: center; + + > svg path { + fill: $grey-color-dark; + } + } + + .trigger { + clear: both; + display: none; + } + + &:hover .trigger { + display: block; + padding-bottom: 5px; + } + + .page-link { + display: block; + padding: 5px 10px; + + &:not(:last-child) { + margin-right: 0; + } + margin-left: 20px; + } + } +} + + + +/** + * Site footer + */ +.site-footer { + border-top: 1px solid $grey-color-light; + padding: $spacing-unit 0; +} + +.footer-heading { + font-size: 18px; + margin-bottom: $spacing-unit / 2; +} + +.contact-list, +.social-media-list { + list-style: none; + margin-left: 0; +} + +.footer-col-wrapper { + font-size: 15px; + color: $grey-color; + margin-left: -$spacing-unit / 2; + @extend %clearfix; +} + +.footer-col { + float: left; + margin-bottom: $spacing-unit / 2; + padding-left: $spacing-unit / 2; +} + +.footer-col-1 { + width: -webkit-calc(35% - (#{$spacing-unit} / 2)); + width: calc(35% - (#{$spacing-unit} / 2)); +} + +.footer-col-2 { + width: -webkit-calc(20% - (#{$spacing-unit} / 2)); + width: calc(20% - (#{$spacing-unit} / 2)); +} + +.footer-col-3 { + width: -webkit-calc(45% - (#{$spacing-unit} / 2)); + width: calc(45% - (#{$spacing-unit} / 2)); +} + +@include media-query($on-laptop) { + .footer-col-1, + .footer-col-2 { + width: -webkit-calc(50% - (#{$spacing-unit} / 2)); + width: calc(50% - (#{$spacing-unit} / 2)); + } + + .footer-col-3 { + width: -webkit-calc(100% - (#{$spacing-unit} / 2)); + width: calc(100% - (#{$spacing-unit} / 2)); + } +} + +@include media-query($on-palm) { + .footer-col { + float: none; + width: -webkit-calc(100% - (#{$spacing-unit} / 2)); + width: calc(100% - (#{$spacing-unit} / 2)); + } +} + + + +/** + * Page content + */ +.page-content { + padding: $spacing-unit 0; +} + +.page-heading { + font-size: 20px; +} + +.post-list { + margin-left: 0; + list-style: none; + + > li { + margin-bottom: $spacing-unit; + } +} + +.post-meta { + font-size: $small-font-size; + color: $grey-color; +} + +.post-link { + display: block; + font-size: 24px; +} + + + +/** + * Posts + */ +.post-header { + margin-bottom: $spacing-unit; +} + +.post-title { + font-size: 42px; + letter-spacing: -1px; + line-height: 1; + + @include media-query($on-laptop) { + font-size: 36px; + } +} + +.post-content { + margin-bottom: $spacing-unit; + + h2 { + font-size: 32px; + + @include media-query($on-laptop) { + font-size: 28px; + } + } + + h3 { + font-size: 26px; + + @include media-query($on-laptop) { + font-size: 22px; + } + } + + h4 { + font-size: 20px; + + @include media-query($on-laptop) { + font-size: 18px; + } + } +} diff --git a/_sass/minima/_syntax-highlighting.scss b/_sass/minima/_syntax-highlighting.scss new file mode 100644 index 000000000..bccdb8995 --- /dev/null +++ b/_sass/minima/_syntax-highlighting.scss @@ -0,0 +1,71 @@ +/** + * Syntax highlighting styles + */ +.highlight { + background: #fff; + @extend %vertical-rhythm; + + .highlighter-rouge & { + background: #eef; + } + + .c { color: #998; font-style: italic } // Comment + .err { color: #a61717; background-color: #e3d2d2 } // Error + .k { font-weight: bold } // Keyword + .o { font-weight: bold } // Operator + .cm { color: #998; font-style: italic } // Comment.Multiline + .cp { color: #999; font-weight: bold } // Comment.Preproc + .c1 { color: #998; font-style: italic } // Comment.Single + .cs { color: #999; font-weight: bold; font-style: italic } // Comment.Special + .gd { color: #000; background-color: #fdd } // Generic.Deleted + .gd .x { color: #000; background-color: #faa } // Generic.Deleted.Specific + .ge { font-style: italic } // Generic.Emph + .gr { color: #a00 } // Generic.Error + .gh { color: #999 } // Generic.Heading + .gi { color: #000; background-color: #dfd } // Generic.Inserted + .gi .x { color: #000; background-color: #afa } // Generic.Inserted.Specific + .go { color: #888 } // Generic.Output + .gp { color: #555 } // Generic.Prompt + .gs { font-weight: bold } // Generic.Strong + .gu { color: #aaa } // Generic.Subheading + .gt { color: #a00 } // Generic.Traceback + .kc { font-weight: bold } // Keyword.Constant + .kd { font-weight: bold } // Keyword.Declaration + .kp { font-weight: bold } // Keyword.Pseudo + .kr { font-weight: bold } // Keyword.Reserved + .kt { color: #458; font-weight: bold } // Keyword.Type + .m { color: #099 } // Literal.Number + .s { color: #d14 } // Literal.String + .na { color: #008080 } // Name.Attribute + .nb { color: #0086B3 } // Name.Builtin + .nc { color: #458; font-weight: bold } // Name.Class + .no { color: #008080 } // Name.Constant + .ni { color: #800080 } // Name.Entity + .ne { color: #900; font-weight: bold } // Name.Exception + .nf { color: #900; font-weight: bold } // Name.Function + .nn { color: #555 } // Name.Namespace + .nt { color: #000080 } // Name.Tag + .nv { color: #008080 } // Name.Variable + .ow { font-weight: bold } // Operator.Word + .w { color: #bbb } // Text.Whitespace + .mf { color: #099 } // Literal.Number.Float + .mh { color: #099 } // Literal.Number.Hex + .mi { color: #099 } // Literal.Number.Integer + .mo { color: #099 } // Literal.Number.Oct + .sb { color: #d14 } // Literal.String.Backtick + .sc { color: #d14 } // Literal.String.Char + .sd { color: #d14 } // Literal.String.Doc + .s2 { color: #d14 } // Literal.String.Double + .se { color: #d14 } // Literal.String.Escape + .sh { color: #d14 } // Literal.String.Heredoc + .si { color: #d14 } // Literal.String.Interpol + .sx { color: #d14 } // Literal.String.Other + .sr { color: #009926 } // Literal.String.Regex + .s1 { color: #d14 } // Literal.String.Single + .ss { color: #990073 } // Literal.String.Symbol + .bp { color: #999 } // Name.Builtin.Pseudo + .vc { color: #008080 } // Name.Variable.Class + .vg { color: #008080 } // Name.Variable.Global + .vi { color: #008080 } // Name.Variable.Instance + .il { color: #099 } // Literal.Number.Integer.Long +} From dd8b6d552391da9278e14f79407a502c2315d2ad Mon Sep 17 00:00:00 2001 From: smitbose Date: Sun, 25 Dec 2016 20:00:27 +0530 Subject: [PATCH 19/32] Modified about --- about.md | 10 +++------- 1 file changed, 3 insertions(+), 7 deletions(-) diff --git a/about.md b/about.md index 19d6b978b..fb074a698 100644 --- a/about.md +++ b/about.md @@ -4,12 +4,8 @@ title: About permalink: /about/ --- -This is the base Jekyll theme. You can find out more info about customizing your Jekyll theme, as well as basic Jekyll usage documentation at [jekyllrb.com](http://jekyllrb.com/) +This repository was created to list some popular algorithms, include tutorials, study materials and contain some implementations, to help students prepare for competitive coding events like ACM ICPC and also for placements. This website contains tutorials for various algorithms and for the corresponding implementation you can check out the repository [Algorithms](https://github.com/codeIIEST/Algorithms) under our [Github Organization](https://github.com/codeIIEST). -You can find the source code for the Jekyll new theme at: -{% include icon-github.html username="jekyll" %} / -[minima](https://github.com/jekyll/minima) +Also, this repository is currently growing, and we want this to always grow, including more and more algorithm implementations. So, you are free to contribute your implementations, making sure they are well documented for the reader to understand. -You can find the source code for Jekyll at -{% include icon-github.html username="jekyll" %} / -[jekyll](https://github.com/jekyll/jekyll) +Happy Coding! From 79cff522331c1c00cca77d6be3c02aaded89ed61 Mon Sep 17 00:00:00 2001 From: smitbose Date: Sun, 25 Dec 2016 21:35:22 +0530 Subject: [PATCH 20/32] changes to footer --- _config.yml | 10 +++----- _includes/footer.html | 51 +++++++++------------------------------ _layouts/home.html | 1 - _sass/minima/_layout.scss | 15 +++++++----- 4 files changed, 25 insertions(+), 52 deletions(-) diff --git a/_config.yml b/_config.yml index f5df98308..9c53ffef7 100644 --- a/_config.yml +++ b/_config.yml @@ -13,16 +13,14 @@ # you will see them accessed via {{ site.title }}, {{ site.email }}, and so on. # You can create any custom variable you would like, and they will be accessible # in the templates via {{ site.myvariable }}. -title: Your awesome title +title: Algorithms email: your-email@domain.com description: > # this means to ignore newlines until "baseurl:" - Write an awesome description for your new site here. You can edit this - line in _config.yml. It will appear in your document head meta (for - Google search results) and in your feed.xml site description. + A repository of some popular algorithms baseurl: "" # the subpath of your site, e.g. /blog url: "" # the base hostname & protocol for your site, e.g. http://example.com -twitter_username: jekyllrb -github_username: jekyll +twitter_username: +github_username: codeIIEST # Build settings markdown: kramdown diff --git a/_includes/footer.html b/_includes/footer.html index dc26507ab..41a768091 100644 --- a/_includes/footer.html +++ b/_includes/footer.html @@ -1,46 +1,19 @@
- -

{{ site.title | escape }}

- -
-
-
    -
  • - {% if site.author %} - {{ site.author | escape }} - {% else %} - {{ site.title | escape }} - {% endif %} -
    • - {% if site.email %} -
  • {{ site.email }}
    • - {% endif %} -
-
- -
- -
- -
-

{{ site.description | escape }}

+
+
+ {% include icon-github.html username=site.github_username%} +
+
+ Created and maintained by codeiiest +
+
+ subscribe via RSS +
-
-
+ +
diff --git a/_layouts/home.html b/_layouts/home.html index 7b15fecec..82d1d9f81 100644 --- a/_layouts/home.html +++ b/_layouts/home.html @@ -20,6 +20,5 @@

{% endfor %} -

subscribe via RSS

diff --git a/_sass/minima/_layout.scss b/_sass/minima/_layout.scss index 11b04583a..407559fb3 100644 --- a/_sass/minima/_layout.scss +++ b/_sass/minima/_layout.scss @@ -122,18 +122,21 @@ } .footer-col-1 { - width: -webkit-calc(35% - (#{$spacing-unit} / 2)); - width: calc(35% - (#{$spacing-unit} / 2)); + text-align: left; + width: -webkit-calc(25% - (#{$spacing-unit} / 2)); + width: calc(25% - (#{$spacing-unit} / 2)); } .footer-col-2 { - width: -webkit-calc(20% - (#{$spacing-unit} / 2)); - width: calc(20% - (#{$spacing-unit} / 2)); + text-align: center; + width: -webkit-calc(50% - (#{$spacing-unit} / 2)); + width: calc(50% - (#{$spacing-unit} / 2)); } .footer-col-3 { - width: -webkit-calc(45% - (#{$spacing-unit} / 2)); - width: calc(45% - (#{$spacing-unit} / 2)); + text-align: right; + width: -webkit-calc(25% - (#{$spacing-unit} / 2)); + width: calc(25% - (#{$spacing-unit} / 2)); } @include media-query($on-laptop) { From a0fdcde655993bd89ebf6186a713cfcff4fc904b Mon Sep 17 00:00:00 2001 From: smitbose Date: Mon, 26 Dec 2016 13:07:13 +0530 Subject: [PATCH 21/32] Added categories --- _sass/minima/tabs.scss | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 _sass/minima/tabs.scss diff --git a/_sass/minima/tabs.scss b/_sass/minima/tabs.scss new file mode 100644 index 000000000..1f86088df --- /dev/null +++ b/_sass/minima/tabs.scss @@ -0,0 +1,26 @@ +div +{ + .category + { + border: 2px solid; + border-radius: 7px; + float: left; + text-align: left; + width: -webkit-calc(80%); + width: calc(80%); + background: #D3D3D3; + padding: 10px 5px 10px 20px; + box-shadow: 5px 5px 2px #888888; + margin: 5px 10% 5px 10%; + font-size: 12px; + h3 { + margin: 0px; + } + } + .category:hover + { + width: -webkit-calc(82%); + width: calc(82%); + padding: 11px 5px 11px 21px; + } +} From 60492e7e5435047dd3a4786322c7ec03a3d40fee Mon Sep 17 00:00:00 2001 From: smitbose Date: Mon, 26 Dec 2016 13:08:15 +0530 Subject: [PATCH 22/32] Added categories --- _layouts/home.html | 45 +++++++++++++++++++++++++++++---------------- _sass/minima.scss | 3 ++- 2 files changed, 31 insertions(+), 17 deletions(-) diff --git a/_layouts/home.html b/_layouts/home.html index 82d1d9f81..c2adae124 100644 --- a/_layouts/home.html +++ b/_layouts/home.html @@ -4,21 +4,34 @@
-

Posts

+

Categories

- {{ content }} - -
    - {% for post in site.posts %} -
  • - {{ post.date | date: "%b %-d, %Y" }} - -

    - {{ post.title | escape }} -

    -
    • - {% endfor %} -
- - +
+

Searching

+ Searching an element from a set of elements +
+
+

Sorting

+ Sorting a set of elements in a particular order +
+
+

Stack and Queue

+ Algorithms that require FIFO or LIFO processing +
+
+

Trees

+ Segment trees, BITs and other algorithms for interval processing and searching +
+
+

Graphs

+ Modelling real life problems as a set of vertices and links between them +
+
+

Greedy and Dynamic Programming

+ Solving a bigger problem through solution of subproblems +
+
+

Others

+ Any algorithm that doesn't come under the above categories +
diff --git a/_sass/minima.scss b/_sass/minima.scss index 29b37004e..5372652f4 100644 --- a/_sass/minima.scss +++ b/_sass/minima.scss @@ -39,5 +39,6 @@ $on-laptop: 800px !default; @import "minima/base", "minima/layout", - "minima/syntax-highlighting" + "minima/syntax-highlighting", + "minima/tabs" ; From b843fc805431114774ea807c49e4069ca1290098 Mon Sep 17 00:00:00 2001 From: smitbose Date: Mon, 26 Dec 2016 15:52:50 +0530 Subject: [PATCH 23/32] Created graph category page --- _layouts/home.html | 2 +- _posts/2016-12-25-welcome-to-jekyll.markdown | 25 -------------------- _posts/graph/2016-12-26-test.markdown | 10 ++++++++ _posts/search/2016-12-26-test.markdown | 10 ++++++++ pages/graph.html | 21 ++++++++++++++++ 5 files changed, 42 insertions(+), 26 deletions(-) delete mode 100644 _posts/2016-12-25-welcome-to-jekyll.markdown create mode 100644 _posts/graph/2016-12-26-test.markdown create mode 100644 _posts/search/2016-12-26-test.markdown create mode 100644 pages/graph.html diff --git a/_layouts/home.html b/_layouts/home.html index c2adae124..8eca8c087 100644 --- a/_layouts/home.html +++ b/_layouts/home.html @@ -22,7 +22,7 @@

Stack and Queue

Trees

Segment trees, BITs and other algorithms for interval processing and searching -
+

Graphs

Modelling real life problems as a set of vertices and links between them
diff --git a/_posts/2016-12-25-welcome-to-jekyll.markdown b/_posts/2016-12-25-welcome-to-jekyll.markdown deleted file mode 100644 index 9c7eef354..000000000 --- a/_posts/2016-12-25-welcome-to-jekyll.markdown +++ /dev/null @@ -1,25 +0,0 @@ ---- -layout: post -title: "Welcome to Jekyll!" -date: 2016-12-25 18:58:43 +0530 -categories: jekyll update ---- -You’ll find this post in your `_posts` directory. Go ahead and edit it and re-build the site to see your changes. You can rebuild the site in many different ways, but the most common way is to run `jekyll serve`, which launches a web server and auto-regenerates your site when a file is updated. - -To add new posts, simply add a file in the `_posts` directory that follows the convention `YYYY-MM-DD-name-of-post.ext` and includes the necessary front matter. Take a look at the source for this post to get an idea about how it works. - -Jekyll also offers powerful support for code snippets: - -{% highlight ruby %} -def print_hi(name) - puts "Hi, #{name}" -end -print_hi('Tom') -#=> prints 'Hi, Tom' to STDOUT. -{% endhighlight %} - -Check out the [Jekyll docs][jekyll-docs] for more info on how to get the most out of Jekyll. File all bugs/feature requests at [Jekyll’s GitHub repo][jekyll-gh]. If you have questions, you can ask them on [Jekyll Talk][jekyll-talk]. - -[jekyll-docs]: http://jekyllrb.com/docs/home -[jekyll-gh]: https://github.com/jekyll/jekyll -[jekyll-talk]: https://talk.jekyllrb.com/ diff --git a/_posts/graph/2016-12-26-test.markdown b/_posts/graph/2016-12-26-test.markdown new file mode 100644 index 000000000..9bbd03b2a --- /dev/null +++ b/_posts/graph/2016-12-26-test.markdown @@ -0,0 +1,10 @@ +--- +layout: post +title: "Test" +date: 2016-12-26 15:36:00 +0530 +categories: graph +--- + +This is just a test file to test post excerpt. + +Thank you diff --git a/_posts/search/2016-12-26-test.markdown b/_posts/search/2016-12-26-test.markdown new file mode 100644 index 000000000..33c152f4f --- /dev/null +++ b/_posts/search/2016-12-26-test.markdown @@ -0,0 +1,10 @@ +--- +layout: post +title: "Test" +date: 2016-12-26 15:36:00 +0530 +categories: search +--- + +This is just a test file to test post excerpt. + +Thank you diff --git a/pages/graph.html b/pages/graph.html new file mode 100644 index 000000000..45c4abb33 --- /dev/null +++ b/pages/graph.html @@ -0,0 +1,21 @@ +--- +layout: default +--- + +
Posts

+ + +
    + {% for post in site.categories.graph %} +
  • + {{ post.date | date: "%b %-d, %Y" }} +

    + {{ post.title | escape }} +

    +
    • + {% endfor %} +
+ + From 940ad5ad031a1e77151efc17f2f28a78cc21c776 Mon Sep 17 00:00:00 2001 From: smitbose Date: Tue, 27 Dec 2016 00:06:15 +0530 Subject: [PATCH 24/32] Made category pages --- _layouts/home.html | 12 +++++------ _layouts/post.html | 2 +- _posts/graph/2016-12-26-test.markdown | 10 --------- _posts/search/2016-12-26-test.markdown | 10 --------- _sass/minima/_layout.scss | 30 ++++++++++++++++++++++---- _sass/minima/tabs.scss | 4 ++-- pages/dp.html | 27 +++++++++++++++++++++++ pages/graph.html | 12 ++++++++--- pages/others.html | 27 +++++++++++++++++++++++ pages/searching.html | 27 +++++++++++++++++++++++ pages/sorting.html | 27 +++++++++++++++++++++++ pages/stackq.html | 27 +++++++++++++++++++++++ pages/trees.html | 27 +++++++++++++++++++++++ 13 files changed, 206 insertions(+), 36 deletions(-) delete mode 100644 _posts/graph/2016-12-26-test.markdown delete mode 100644 _posts/search/2016-12-26-test.markdown create mode 100644 pages/dp.html create mode 100644 pages/others.html create mode 100644 pages/searching.html create mode 100644 pages/sorting.html create mode 100644 pages/stackq.html create mode 100644 pages/trees.html diff --git a/_layouts/home.html b/_layouts/home.html index 8eca8c087..0de0324a7 100644 --- a/_layouts/home.html +++ b/_layouts/home.html @@ -6,19 +6,19 @@

Categories

-
+

Searching

Searching an element from a set of elements
-
+

Sorting

Sorting a set of elements in a particular order
-
+

Stack and Queue

Algorithms that require FIFO or LIFO processing
-
+

Trees

Segment trees, BITs and other algorithms for interval processing and searching
@@ -26,11 +26,11 @@

Trees

Graphs

Modelling real life problems as a set of vertices and links between them
-
+

Greedy and Dynamic Programming

Solving a bigger problem through solution of subproblems
-
+

Others

Any algorithm that doesn't come under the above categories
diff --git a/_layouts/post.html b/_layouts/post.html index 1d36c2828..ddce7bf45 100644 --- a/_layouts/post.html +++ b/_layouts/post.html @@ -7,7 +7,7 @@

{{ page.title | escape }}

{% if page.author %} • {% endif %}

- +
{{ content }}
diff --git a/_posts/graph/2016-12-26-test.markdown b/_posts/graph/2016-12-26-test.markdown deleted file mode 100644 index 9bbd03b2a..000000000 --- a/_posts/graph/2016-12-26-test.markdown +++ /dev/null @@ -1,10 +0,0 @@ ---- -layout: post -title: "Test" -date: 2016-12-26 15:36:00 +0530 -categories: graph ---- - -This is just a test file to test post excerpt. - -Thank you diff --git a/_posts/search/2016-12-26-test.markdown b/_posts/search/2016-12-26-test.markdown deleted file mode 100644 index 33c152f4f..000000000 --- a/_posts/search/2016-12-26-test.markdown +++ /dev/null @@ -1,10 +0,0 @@ ---- -layout: post -title: "Test" -date: 2016-12-26 15:36:00 +0530 -categories: search ---- - -This is just a test file to test post excerpt. - -Thank you diff --git a/_sass/minima/_layout.scss b/_sass/minima/_layout.scss index 407559fb3..852b4e742 100644 --- a/_sass/minima/_layout.scss +++ b/_sass/minima/_layout.scss @@ -180,11 +180,24 @@ > li { margin-bottom: $spacing-unit; } + h2 + { + margin: 15px 0px 0px 0px; + } } .post-meta { font-size: $small-font-size; color: $grey-color; + //margin-bottom: 5px; + float: left; +} + +.post-author { + font-size: $small-font-size; + color: $grey-color; + //margin-bottom: 5px; + float: right; } .post-link { @@ -192,20 +205,28 @@ font-size: 24px; } - +.post-excerpt { + float: left; +} /** * Posts */ +.post { + p { + margin: 0px; + } +} + .post-header { margin-bottom: $spacing-unit; } .post-title { - font-size: 42px; + font-size: 30px; letter-spacing: -1px; line-height: 1; - + font-weight: 800; @include media-query($on-laptop) { font-size: 36px; } @@ -213,7 +234,8 @@ .post-content { margin-bottom: $spacing-unit; - + float: left; + padding-top: 15px; h2 { font-size: 32px; diff --git a/_sass/minima/tabs.scss b/_sass/minima/tabs.scss index 1f86088df..19e12582f 100644 --- a/_sass/minima/tabs.scss +++ b/_sass/minima/tabs.scss @@ -2,13 +2,13 @@ div { .category { - border: 2px solid; + border: 0px solid; border-radius: 7px; float: left; text-align: left; width: -webkit-calc(80%); width: calc(80%); - background: #D3D3D3; + background: rgba(227,222,222,0.5); padding: 10px 5px 10px 20px; box-shadow: 5px 5px 2px #888888; margin: 5px 10% 5px 10%; diff --git a/pages/dp.html b/pages/dp.html new file mode 100644 index 000000000..da7fadaf4 --- /dev/null +++ b/pages/dp.html @@ -0,0 +1,27 @@ +--- +layout: default +--- + +
+ + + + +
    + {% for post in site.categories.dpgreedy %} +
  • +

    + {{ post.title | escape }} +

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading... +
    • + {% endfor %} +
+ +
diff --git a/pages/graph.html b/pages/graph.html index 45c4abb33..99fdf9b74 100644 --- a/pages/graph.html +++ b/pages/graph.html @@ -2,18 +2,24 @@ layout: default --- -
-

Posts

+
    {% for post in site.categories.graph %}
  • - {{ post.date | date: "%b %-d, %Y" }}

    {{ post.title | escape }}

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading...
    • {% endfor %}
diff --git a/pages/others.html b/pages/others.html new file mode 100644 index 000000000..6a1b26ea8 --- /dev/null +++ b/pages/others.html @@ -0,0 +1,27 @@ +--- +layout: default +--- + +
+ + + + +
    + {% for post in site.categories.others %} +
  • +

    + {{ post.title | escape }} +

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading... +
    • + {% endfor %} +
+ +
diff --git a/pages/searching.html b/pages/searching.html new file mode 100644 index 000000000..d101bdd1e --- /dev/null +++ b/pages/searching.html @@ -0,0 +1,27 @@ +--- +layout: default +--- + +
+ + + + +
    + {% for post in site.categories.search %} +
  • +

    + {{ post.title | escape }} +

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading... +
    • + {% endfor %} +
+ +
diff --git a/pages/sorting.html b/pages/sorting.html new file mode 100644 index 000000000..1010a068c --- /dev/null +++ b/pages/sorting.html @@ -0,0 +1,27 @@ +--- +layout: default +--- + +
+ + + + +
    + {% for post in site.categories.sort %} +
  • +

    + {{ post.title | escape }} +

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading... +
    • + {% endfor %} +
+ +
diff --git a/pages/stackq.html b/pages/stackq.html new file mode 100644 index 000000000..e24008024 --- /dev/null +++ b/pages/stackq.html @@ -0,0 +1,27 @@ +--- +layout: default +--- + +
+ + + + +
    + {% for post in site.categories.stackq %} +
  • +

    + {{ post.title | escape }} +

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading... +
    • + {% endfor %} +
+ +
diff --git a/pages/trees.html b/pages/trees.html new file mode 100644 index 000000000..ce31425dd --- /dev/null +++ b/pages/trees.html @@ -0,0 +1,27 @@ +--- +layout: default +--- + +
+ + + + +
    + {% for post in site.categories.tree %} +
  • +

    + {{ post.title | escape }} +

    +
    {{ post.date | date: "%b %-d, %Y" }} • {{ post.author }}
    +
    +
    + {{ post.content | strip_html | truncatewords: 30 }} +
    +
    + Continue Reading... +
    • + {% endfor %} +
+ +
From 3301842738763ab0a50d7a06666304cedb77faef Mon Sep 17 00:00:00 2001 From: smitbose Date: Tue, 27 Dec 2016 00:12:27 +0530 Subject: [PATCH 25/32] Added gitkeep to folders --- _posts/dpgreedy/.gitkeep | 0 _posts/graph/.gitkeep | 0 _posts/others/.gitkeep | 0 _posts/search/.gitkeep | 0 _posts/sort/.gitkeep | 0 _posts/stackq/.gitkeep | 0 _posts/tree/.gitkeep | 0 7 files changed, 0 insertions(+), 0 deletions(-) create mode 100644 _posts/dpgreedy/.gitkeep create mode 100644 _posts/graph/.gitkeep create mode 100644 _posts/others/.gitkeep create mode 100644 _posts/search/.gitkeep create mode 100644 _posts/sort/.gitkeep create mode 100644 _posts/stackq/.gitkeep create mode 100644 _posts/tree/.gitkeep diff --git a/_posts/dpgreedy/.gitkeep b/_posts/dpgreedy/.gitkeep new file mode 100644 index 000000000..e69de29bb diff --git a/_posts/graph/.gitkeep b/_posts/graph/.gitkeep new file mode 100644 index 000000000..e69de29bb diff --git a/_posts/others/.gitkeep b/_posts/others/.gitkeep new file mode 100644 index 000000000..e69de29bb diff --git a/_posts/search/.gitkeep b/_posts/search/.gitkeep new file mode 100644 index 000000000..e69de29bb diff --git a/_posts/sort/.gitkeep b/_posts/sort/.gitkeep new file mode 100644 index 000000000..e69de29bb diff --git a/_posts/stackq/.gitkeep b/_posts/stackq/.gitkeep new file mode 100644 index 000000000..e69de29bb diff --git a/_posts/tree/.gitkeep b/_posts/tree/.gitkeep new file mode 100644 index 000000000..e69de29bb From dcfc3b71173aab5dd0b50680e0004cfe47c8c4d8 Mon Sep 17 00:00:00 2001 From: smitbose Date: Tue, 27 Dec 2016 00:44:00 +0530 Subject: [PATCH 26/32] Debugs --- _layouts/home.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/_layouts/home.html b/_layouts/home.html index 0de0324a7..23015d03c 100644 --- a/_layouts/home.html +++ b/_layouts/home.html @@ -5,8 +5,8 @@

Categories

- -
+ {% assign searchurl="/pages/searching.html" %} +

Searching

Searching an element from a set of elements
From 00728dcff01b31ca3ff56f42b9ad7fb35cee78fd Mon Sep 17 00:00:00 2001 From: smitbose Date: Tue, 27 Dec 2016 00:57:27 +0530 Subject: [PATCH 27/32] url linking debug --- _config.yml | 2 +- _layouts/home.html | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/_config.yml b/_config.yml index 9c53ffef7..6e6db2ee7 100644 --- a/_config.yml +++ b/_config.yml @@ -17,7 +17,7 @@ title: Algorithms email: your-email@domain.com description: > # this means to ignore newlines until "baseurl:" A repository of some popular algorithms -baseurl: "" # the subpath of your site, e.g. /blog +baseurl: "/Algorithms" # the subpath of your site, e.g. /blog url: "" # the base hostname & protocol for your site, e.g. http://example.com twitter_username: github_username: codeIIEST diff --git a/_layouts/home.html b/_layouts/home.html index 23015d03c..7f5a537c8 100644 --- a/_layouts/home.html +++ b/_layouts/home.html @@ -6,7 +6,7 @@

Categories

{% assign searchurl="/pages/searching.html" %} -
+

Searching

Searching an element from a set of elements
From 23e864e311e00d31ee549831286ba8dce67af179 Mon Sep 17 00:00:00 2001 From: smitbose Date: Tue, 27 Dec 2016 01:08:58 +0530 Subject: [PATCH 28/32] Fixed urls --- _layouts/.home.html.swp | Bin 0 -> 12288 bytes _layouts/home.html | 20 +++++++++++++------- 2 files changed, 13 insertions(+), 7 deletions(-) create mode 100644 _layouts/.home.html.swp diff --git a/_layouts/.home.html.swp b/_layouts/.home.html.swp new file mode 100644 index 0000000000000000000000000000000000000000..a60ba3eb9f08a9809f8c86729ece9ad1791eab7e GIT binary patch literal 12288 zcmeI2zi%8x6vrn>2nfWO9|aB4<51)R&KDC2Mdo}W1UWJyGRWaahh}fz-EO?Qv!0o~ z$TEhK|A8t61r2`!Ee!<)h<_mzRM1c$#CP^~?=0g)cCJ8{-sryCyV*Ch?|t5z9a)~} z%Ew!`=-TQPg|@8JCwuzSU)Nt$_nuSAnJQ0xxbg6ITDvc%hP~_A*x1x3x$AwF>3vgq z*Go*!tBKFEhd)a03IQSTCR!8~uD-EWFZEYDuh0w6fAlCb$rvFZ1cZPP5CTF# z2nYcoAOy}S0bgEFU&8mt8vkEwt{0A7o1bzK0zyCt2mv7=1cZPP5CTF#2nYcoAOy}K z0Uay#=95bO1BL(pw}1ct{j5^IL%%`ypLtP(0kC!&>u@m{Q%vA9P|?O*Cq5p z-$OC92`xiUK;J#1)K}0J^fq+=X{COI9CQa-hW@;$)Hl%A&<$t_`spdm31!eWv;;j4 z)qbBt?&7i#5CTF#2nYco@P85L_u_OiP(-sYgm%5yC*7V=B%f$cv0+!NcpBoEB2`7q z7X3^*G83ku_8d+$vcpWF^^>cEel*yIiFN&6H0bxxqi_R{qhY3<+vqf-_B&*XVU`Ye zH#(U?XKISo#PVok<=}u!n4+>7eNLt2l8boVrJh$K?KpHF9dm1&EZ@GfXl+MsU+FXlEJIJ?)g zYS0BW9@EI0e7-i?IF5PT4qVLVdY038eQ+5I)}>>-f13B(MyFTmF}q&f;p&s%9lCr7 zKj+5vTVrM!mnU1b%W-B{cbsh7)cDM_UW_N3wuLmatvmJ}U_4FV+;&<|4=`@I&CT0< z939Y4*4nKjpz0>9W7KG8aAUUpV4GPRD0Os~3FqpuL8xxGtEOk|*D2

Categories

- {% assign searchurl="/pages/searching.html" %} + {% assign searchurl="/pages/searching.html" %} + {% assign sorturl="/pages/sorting.html" %} + {% assign stackurl="/pages/stackq.html" %} + {% assign treeurl="/pages/trees.html" %} + {% assign graphurl="/pages/graph.html" %} + {% assign dpurl="/pages/dp.html" %} + {% assign otherurl="/pages/others.html" %}

Searching

Searching an element from a set of elements
-
+

Sorting

Sorting a set of elements in a particular order
-
+

Stack and Queue

Algorithms that require FIFO or LIFO processing
-
+

Trees

Segment trees, BITs and other algorithms for interval processing and searching
-
+

Graphs

Modelling real life problems as a set of vertices and links between them
-
+

Greedy and Dynamic Programming

Solving a bigger problem through solution of subproblems
-
+

Others

Any algorithm that doesn't come under the above categories
From 91063bd977da1befb6089e55d08fb4f31959575e Mon Sep 17 00:00:00 2001 From: Prateek Chanda Date: Tue, 27 Dec 2016 09:17:54 +0530 Subject: [PATCH 29/32] Create SortsTutorial.md Created tutorial for Sorts under _posts/sort --- _posts/sort/SortsTutorial.md | 63 ++++++++++++++++++++++++++++++++++++ 1 file changed, 63 insertions(+) create mode 100644 _posts/sort/SortsTutorial.md diff --git a/_posts/sort/SortsTutorial.md b/_posts/sort/SortsTutorial.md new file mode 100644 index 000000000..4d990359d --- /dev/null +++ b/_posts/sort/SortsTutorial.md @@ -0,0 +1,63 @@ +## Sorting + +- [ ] Notes: + - Implement sorts & know best case/worst case, average complexity of each: + - no bubble sort - it's terrible - O(n^2), except when n <= 16 + - [ ] stability in sorting algorithms ("Is Quicksort stable?") + - [Sorting Algorithm Stability](https://en.wikipedia.org/wiki/Sorting_algorithm#Stability) + - [Stability In Sorting Algorithms](http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms) + - [Stability In Sorting Algorithms](http://www.geeksforgeeks.org/stability-in-sorting-algorithms/) + - [Sorting Algorithms - Stability](http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf) + - [ ] Which algorithms can be used on linked lists? Which on arrays? Which on both? + - I wouldn't recommend sorting a linked list, but merge sort is doable. + - [Merge Sort For Linked List](http://www.geeksforgeeks.org/merge-sort-for-linked-list/) + +- For heapsort, see Heap data structure above. Heap sort is great, but not stable. + +- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB) +- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB) +- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) +- [ ] [Insertion Sort (video)](https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB) +- [ ] [Merge Sort (video)](https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB) +- [ ] [Quicksort (video)](https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB) +- [ ] [Selection Sort (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB) + +- [ ] Stanford lectures on sorting: + - [ ] [Lecture 15 | Programming Abstractions (video)](https://www.youtube.com/watch?v=ENp00xylP7c&index=15&list=PLFE6E58F856038C69) + - [ ] [Lecture 16 | Programming Abstractions (video)](https://www.youtube.com/watch?v=y4M9IVgrVKo&index=16&list=PLFE6E58F856038C69) + +- [ ] Shai Simonson, [Aduni.org](http://www.aduni.org/): + - [ ] [Algorithms - Sorting - Lecture 2 (video)](https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=2) + - [ ] [Algorithms - Sorting II - Lecture 3 (video)](https://www.youtube.com/watch?v=hj8YKFTFKEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=3) + +- [ ] Steven Skiena lectures on sorting: + - [ ] [lecture begins at 26:46 (video)](https://youtu.be/ute-pmMkyuk?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1600) + - [ ] [lecture begins at 27:40 (video)](https://www.youtube.com/watch?v=yLvp-pB8mak&index=8&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) + - [ ] [lecture begins at 35:00 (video)](https://www.youtube.com/watch?v=q7K9otnzlfE&index=9&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) + - [ ] [lecture begins at 23:50 (video)](https://www.youtube.com/watch?v=TvqIGu9Iupw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=10) + +- [ ] UC Berkeley: + - [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29) + - [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30) + - [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C) + - [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C) + +- [ ] - Merge sort code: + - [ ] [Using output array](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c) + - [ ] [In-place](https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc) +- [ ] - Quick sort code: + - [ ] [Implementation](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c) + - [ ] [Implementation](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c) + +- [ ] Implement: + - [ ] Mergesort: O(n log n) average and worst case + - [ ] Quicksort O(n log n) average case + - Selection sort and insertion sort are both O(n^2) average and worst case + - For heapsort, see Heap data structure above. + +- [ ] For curiosity - not required: + - [ ] [Radix Sort](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort) + - [ ] [Radix Sort (video)](https://www.youtube.com/watch?v=xhr26ia4k38) + - [ ] [Radix Sort, Counting Sort (linear time given constraints) (video)](https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) + - [ ] [Randomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)](https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) + - [ ] [Sorting in Linear Time (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14) From 3e93028d6f6529f12061812cc89c3fdb0d73366d Mon Sep 17 00:00:00 2001 From: Prateek Chanda Date: Tue, 27 Dec 2016 10:28:06 +0530 Subject: [PATCH 30/32] Update SortsTutorial.md --- _posts/sort/SortsTutorial.md | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/_posts/sort/SortsTutorial.md b/_posts/sort/SortsTutorial.md index 4d990359d..f9277cdea 100644 --- a/_posts/sort/SortsTutorial.md +++ b/_posts/sort/SortsTutorial.md @@ -1,5 +1,9 @@ +--- + ## Sorting +date: 2016-12-27 08:28:45 + - [ ] Notes: - Implement sorts & know best case/worst case, average complexity of each: - no bubble sort - it's terrible - O(n^2), except when n <= 16 @@ -61,3 +65,9 @@ - [ ] [Radix Sort, Counting Sort (linear time given constraints) (video)](https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) - [ ] [Randomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)](https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - [ ] [Sorting in Linear Time (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14) + + +Author : Prateek Chanda + +--- + From c1f990f45263a37656cd8863e81ee3c2a90c5361 Mon Sep 17 00:00:00 2001 From: Soumit Bose Date: Sun, 12 Mar 2017 19:32:46 +0530 Subject: [PATCH 31/32] Revert "2016-12-27-SortsTutorial.md" --- _posts/sort/SortsTutorial.md | 73 ------------------------------------ 1 file changed, 73 deletions(-) delete mode 100644 _posts/sort/SortsTutorial.md diff --git a/_posts/sort/SortsTutorial.md b/_posts/sort/SortsTutorial.md deleted file mode 100644 index f9277cdea..000000000 --- a/_posts/sort/SortsTutorial.md +++ /dev/null @@ -1,73 +0,0 @@ ---- - -## Sorting - -date: 2016-12-27 08:28:45 - -- [ ] Notes: - - Implement sorts & know best case/worst case, average complexity of each: - - no bubble sort - it's terrible - O(n^2), except when n <= 16 - - [ ] stability in sorting algorithms ("Is Quicksort stable?") - - [Sorting Algorithm Stability](https://en.wikipedia.org/wiki/Sorting_algorithm#Stability) - - [Stability In Sorting Algorithms](http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms) - - [Stability In Sorting Algorithms](http://www.geeksforgeeks.org/stability-in-sorting-algorithms/) - - [Sorting Algorithms - Stability](http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf) - - [ ] Which algorithms can be used on linked lists? Which on arrays? Which on both? - - I wouldn't recommend sorting a linked list, but merge sort is doable. - - [Merge Sort For Linked List](http://www.geeksforgeeks.org/merge-sort-for-linked-list/) - -- For heapsort, see Heap data structure above. Heap sort is great, but not stable. - -- [ ] [Bubble Sort (video)](https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB) -- [ ] [Analyzing Bubble Sort (video)](https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB) -- [ ] [Insertion Sort, Merge Sort (video)](https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) -- [ ] [Insertion Sort (video)](https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB) -- [ ] [Merge Sort (video)](https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB) -- [ ] [Quicksort (video)](https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB) -- [ ] [Selection Sort (video)](https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB) - -- [ ] Stanford lectures on sorting: - - [ ] [Lecture 15 | Programming Abstractions (video)](https://www.youtube.com/watch?v=ENp00xylP7c&index=15&list=PLFE6E58F856038C69) - - [ ] [Lecture 16 | Programming Abstractions (video)](https://www.youtube.com/watch?v=y4M9IVgrVKo&index=16&list=PLFE6E58F856038C69) - -- [ ] Shai Simonson, [Aduni.org](http://www.aduni.org/): - - [ ] [Algorithms - Sorting - Lecture 2 (video)](https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=2) - - [ ] [Algorithms - Sorting II - Lecture 3 (video)](https://www.youtube.com/watch?v=hj8YKFTFKEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=3) - -- [ ] Steven Skiena lectures on sorting: - - [ ] [lecture begins at 26:46 (video)](https://youtu.be/ute-pmMkyuk?list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&t=1600) - - [ ] [lecture begins at 27:40 (video)](https://www.youtube.com/watch?v=yLvp-pB8mak&index=8&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) - - [ ] [lecture begins at 35:00 (video)](https://www.youtube.com/watch?v=q7K9otnzlfE&index=9&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b) - - [ ] [lecture begins at 23:50 (video)](https://www.youtube.com/watch?v=TvqIGu9Iupw&list=PLOtl7M3yp-DV69F32zdK7YJcNXpTunF2b&index=10) - -- [ ] UC Berkeley: - - [ ] [CS 61B Lecture 29: Sorting I (video)](https://www.youtube.com/watch?v=EiUvYS2DT6I&list=PL4BBB74C7D2A1049C&index=29) - - [ ] [CS 61B Lecture 30: Sorting II (video)](https://www.youtube.com/watch?v=2hTY3t80Qsk&list=PL4BBB74C7D2A1049C&index=30) - - [ ] [CS 61B Lecture 32: Sorting III (video)](https://www.youtube.com/watch?v=Y6LOLpxg6Dc&index=32&list=PL4BBB74C7D2A1049C) - - [ ] [CS 61B Lecture 33: Sorting V (video)](https://www.youtube.com/watch?v=qNMQ4ly43p4&index=33&list=PL4BBB74C7D2A1049C) - -- [ ] - Merge sort code: - - [ ] [Using output array](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c) - - [ ] [In-place](https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc) -- [ ] - Quick sort code: - - [ ] [Implementation](http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c) - - [ ] [Implementation](https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c) - -- [ ] Implement: - - [ ] Mergesort: O(n log n) average and worst case - - [ ] Quicksort O(n log n) average case - - Selection sort and insertion sort are both O(n^2) average and worst case - - For heapsort, see Heap data structure above. - -- [ ] For curiosity - not required: - - [ ] [Radix Sort](http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort) - - [ ] [Radix Sort (video)](https://www.youtube.com/watch?v=xhr26ia4k38) - - [ ] [Radix Sort, Counting Sort (linear time given constraints) (video)](https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb) - - [ ] [Randomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)](https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp) - - [ ] [Sorting in Linear Time (video)](https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14) - - -Author : Prateek Chanda - ---- - From 266d9069916ce276f7b3f96ab06d09aa36ca7dc2 Mon Sep 17 00:00:00 2001 From: smitbose Date: Sat, 10 Jun 2017 16:27:22 +0530 Subject: [PATCH 32/32] Updated Gemfile.lock --- Gemfile.lock | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Gemfile.lock b/Gemfile.lock index f1c082640..5274988a4 100644 --- a/Gemfile.lock +++ b/Gemfile.lock @@ -50,7 +50,7 @@ DEPENDENCIES minima (~> 2.0) RUBY VERSION - ruby 2.3.3p222 + ruby 2.4.1p111 BUNDLED WITH - 1.13.6 + 1.15.1