tag:blogger.com,1999:blog-3675582796619590206.post7427234273180898146..comments2024-03-19T15:01:12.924+06:00Comments on I, ME AND MYSELF !!!: Practice RecursionsZobayer Hasanhttp://www.blogger.com/profile/10946508827987290398noreply@blogger.comBlogger30125tag:blogger.com,1999:blog-3675582796619590206.post-79119548925771979852018-02-21T15:29:51.981+06:002018-02-21T15:29:51.981+06:00It will raise warning during compilation, also, th...It will raise warning during compilation, also, the method will return a garbage value if any statement that called the function initially was expecting a value. If you do not expect a return value from a function call, then there is not problem. Look at the following example:<br /><br />int a() {<br />// do not return anything<br />}<br /><br />---- in main ---<br />a(); // no problem<br />int x = a(); // now there is a problem<br /><br />I hope this clears up the confusion.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-74157891291139568762018-02-14T18:18:43.697+06:002018-02-14T18:18:43.697+06:00Can anyone tell what is use of return statement wh...Can anyone tell what is use of return statement while returning a value in recursion...<br />What if I don't write return in front of function naming which is not of void type?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-91717489013052337312017-12-05T00:57:39.083+06:002017-12-05T00:57:39.083+06:00problem 12,20 seems very difficult than others .problem 12,20 seems very difficult than others .Assasinhttps://www.blogger.com/profile/16908667540636355299noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-16926086219233208992016-10-30T11:19:46.070+06:002016-10-30T11:19:46.070+06:00really its too helpful.really its too helpful.Programming is funhttps://www.blogger.com/profile/04533802016683522864noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-54852993644606042652016-10-10T23:25:12.023+06:002016-10-10T23:25:12.023+06:00Why do you set sum = 1 when i == 1.Why do you set sum = 1 when i == 1.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-23868803957766261732016-10-10T01:01:47.419+06:002016-10-10T01:01:47.419+06:00sakhawatshamim35@gmail.com এই ইমেইল ও জানাতে পারেন...sakhawatshamim35@gmail.com এই ইমেইল ও জানাতে পারেন।সাখাওয়াতের ব্লগhttps://www.blogger.com/profile/10296657772156693789noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-78156136614164221302016-10-10T00:52:45.395+06:002016-10-10T00:52:45.395+06:00/**
Write a recursive solution to evaluate the pre.../**<br />Write a recursive solution to evaluate the previous polynomial for any given x and n.<br />Like, when x=2 and n=5, we have 1 + x + x2 + ................. + xn-1 = 31<br /><br />Input:<br />2 5<br />Output:<br />31<br /><br />**/<br /><br />#include<br />using namespace std;<br />int print(int i,int x,int n,int sum)<br />{<br /> if(i==1)<br /> {<br /> sum=1;<br /> }<br /> if(i>1)<br /> {<br /> sum+=pow(x,i-1);<br /> }<br /> if(i==n)<br /> return sum;<br /> print(i+1,x,n,sum);<br />}<br />int main()<br />{<br /> cout<<print(1,2,5,0)<<endl;;<br /> return 0;<br />}<br /><br />ভাইয়া আমি এইভাবে করছি। আমারটা কি হইছে? নাকি কোন বাগ আছে? জানালে ভালো হত।সাখাওয়াতের ব্লগhttps://www.blogger.com/profile/10296657772156693789noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-6705572899962030342016-09-02T23:11:15.077+06:002016-09-02T23:11:15.077+06:00//================================================...//============================================================================<br />// Name : TowerOfHanoiRecursion.cpp<br />// Author : Nitish Raj, Scientist, DRDO, raj.nitp@gmail.com<br />// Version :<br />// Copyright : No Copyright<br />// Description : Ansi-style<br />//============================================================================<br /><br />#include <br />#include <br />#include <br /><br />#include <br />using namespace std;<br /><br /><br />/*<br /> | | |<br />___|___ __|__ __|__<br />Source Auxilary Destination<br /><br /> */<br />/*Function say whenever you call this second argument will be always from where<br />you have to element and fourth argument says where you need to put and third used as<br />spare */<br /><br />stack A,B,C;<br /><br />void moveData(char Src, char Des){<br /><br /> switch(Src)<br /> {<br /> case 'a':<br /> {<br /> if(Des == 'b') B.push(A.top());<br /> if(Des == 'c') C.push(A.top());<br /> A.pop();<br /> break;<br /> }<br /> case 'b':<br /> {<br /> if(Des == 'a') A.push(B.top());<br /> if(Des == 'c') C.push(B.top());<br /> B.pop();<br /> break;<br /> }<br /> case 'c':<br /> {<br /> if(Des == 'b') B.push(C.top());<br /> if(Des == 'a') A.push(C.top());<br /> C.pop();<br /> break;<br /> }<br /> }<br /><br />}<br />void ShowDataofStack(){<br /> stack temp;<br /> cout<<"TOWER A :: ";<br /> temp = A;<br /><br /> while(!temp.empty()){<br /> cout<0)<br /> {<br /> HanoiTowerRec(n-1, Source,Destination, Aux); //<br /><br /> // Now nth element left on Source so put this to Destination;<br /> cout<<"______________________________________ "<"<>n;<br /> for(int i =0 ; i<n;i++) A.push(n-i);<br /> HanoiTowerRec(n, 'a', 'b', 'c');<br /><br /><br /><br /> return 0;<br />}<br />Anonymoushttps://www.blogger.com/profile/12541480130721501108noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-64436738473865686682016-08-30T19:05:25.587+06:002016-08-30T19:05:25.587+06:00how i can write a recursive problem to generate al...how i can write a recursive problem to generate all permutations of a given n numbers?<br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-61482427924141210052016-07-06T14:48:22.370+06:002016-07-06T14:48:22.370+06:00You are welcome :)You are welcome :)Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-79682192787269129502016-07-04T01:05:29.535+06:002016-07-04T01:05:29.535+06:00Thanks so so so so so sooooooooooooooooooooooooooo...Thanks so so so so so sooooooooooooooooooooooooooooooooooooooooooo much <3Anonymoushttps://www.blogger.com/profile/09200616262421144052noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-59715428129632687892016-07-01T18:52:30.373+06:002016-07-01T18:52:30.373+06:00Hi, your code is broken because of HTML characters...Hi, your code is broken because of HTML characters. Can you post your code here and then give me the link?<br />http://codepad.org/Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-88632328003035198942016-06-29T15:24:11.393+06:002016-06-29T15:24:11.393+06:00Can u plz tell me what's wrong with my code? A...Can u plz tell me what's wrong with my code? All the time, it returns the correct ans with an extra value. why is there an extra?<br />int call(int i,int n,int a[])<br />{<br /> if(i<=n)<br /> {<br /><br /> cout<>n;<br /> {<br /> for(int i=0; i>a[i];<br /> cout<<call(0,n-1,a)<<endl;<br /> return 0;<br /> }<br /><br />}<br /><br />Swad Tasnimhttps://www.blogger.com/profile/12115671683227857816noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-85274376205891413052016-05-22T16:38:20.217+06:002016-05-22T16:38:20.217+06:00haha, nice recursion, (but your program cannot cal...haha, nice recursion, (but your program cannot call main() )<br />you're welcome!Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-31273717017553422492016-05-22T12:56:37.003+06:002016-05-22T12:56:37.003+06:00int main(){
printf("Thank you\n");
...int main(){<br /> printf("Thank you\n");<br /> main();<br />}Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-60467862715682745342016-02-11T00:33:11.958+06:002016-02-11T00:33:11.958+06:00Which ones?Which ones?Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-55904290131112814572016-02-05T16:31:55.126+06:002016-02-05T16:31:55.126+06:00কিছু কিছু Problem বুঝতে পারলাম না ! কিছু কিছু Problem বুঝতে পারলাম না ! Anonymoushttps://www.blogger.com/profile/00549780121743117104noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-78984750484492112542016-01-18T19:05:39.537+06:002016-01-18T19:05:39.537+06:00I have tested the following code and it give me co...I have tested the following code and it give me correct result But the answer script has one extra line before recursive call. the line is "if(*sbest < a[i]) *sbest = a[i];". Is it necessary? If necessary, would you kindly explain to me.<br /><br />void sMax(int i, int n, int *a, int *fbest, int *sbest)<br />{<br /> if (i == n - 1)<br /> {<br /> *fbest = a[i];<br /> return;<br /><br /> }<br /> <br /><br /> sMax((i + 1), n, a, fbest, sbest);<br /><br /> if (a[i] > *fbest)<br /> {<br /> *sbest = *fbest;<br /> *fbest = a[i];<br /> }<br /> else if (a[i] > *sbest)<br /> *sbest = a[i];<br /><br /> return;<br /><br />}Anonymoushttps://www.blogger.com/profile/09605562144079266036noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-87370681255798699472015-12-07T14:27:46.449+06:002015-12-07T14:27:46.449+06:00I'm glad that you liked it :)I'm glad that you liked it :)Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-34702429546160317632015-12-07T14:24:14.091+06:002015-12-07T14:24:14.091+06:00That's damn important and fun ...................That's damn important and fun ........................... Had a lot of fum :D Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-90078830826165063032015-06-14T00:46:13.298+06:002015-06-14T00:46:13.298+06:00thank u so much vai..............really helpful!thank u so much vai..............really helpful!nazmul sarkerhttps://www.blogger.com/profile/07735997454386222962noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-47058793120001485242015-01-23T10:08:21.970+06:002015-01-23T10:08:21.970+06:00wow!! It is very helpful for me and anyone . Thank...wow!! It is very helpful for me and anyone . Thank you so much for this good job.সোহাগ হোসেনhttps://www.blogger.com/profile/00553856074967433981noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-20047515741424147872013-03-14T02:23:11.416+06:002013-03-14T02:23:11.416+06:00Actually, after solving lots of dp and recursive p...Actually, after solving lots of dp and recursive problem, this is what I would say: If you want to learn dp / backtracking algorithm, you have to solve as many dp as possible, the only way to improve dp skill is to solving more and more. Frustrating at some points, but I don't think there is any other options.Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-28644683576942651492013-03-14T02:17:20.058+06:002013-03-14T02:17:20.058+06:00I am trying to learn recursion.I can write easy re...I am trying to learn recursion.I can write easy recursion.But when I am trying to write a recursion for backtracking problem or dp, most of the time I failed.But if I see a medium hard recursive func I relaize it easily.But if I try to write a new recusion most of the time I failed.Anonymoushttps://www.blogger.com/profile/18395045775252710886noreply@blogger.comtag:blogger.com,1999:blog-3675582796619590206.post-11024562510750396382012-12-31T01:10:56.081+06:002012-12-31T01:10:56.081+06:00I am really glad that it helped, my best wishes fo...I am really glad that it helped, my best wishes for you :)Zobayer Hasanhttps://www.blogger.com/profile/10946508827987290398noreply@blogger.com