Comments on: Introduction to Recursion in C++ http://talkbinary.com/programming/c/introduction-to-recursion-in-c/ Programming Resources, Technology, Computers Wed, 18 Jan 2012 02:15:00 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Diego Villasenor http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-27423 Diego Villasenor Sun, 29 May 2011 01:48:00 +0000 http://talkbinary.com/?p=1572#comment-27423 This algorithm goes through the commands sequentially. So it will proceed with mergesort(a,0,2) until it returns a result. So yes, it would be broken down to mergesort(a, 0,1) and would compute that as well. *Not sure if it would be 0,1 but you should understand what I'm referring too. Let me know if you have any additional questions. :) This algorithm goes through the commands sequentially. So it will proceed with mergesort(a,0,2) until it returns a result. So yes, it would be broken down to mergesort(a, 0,1) and would compute that as well.

*Not sure if it would be 0,1 but you should understand what I’m referring too. Let me know if you have any additional questions. :)

]]> By: Singhashutosh90 http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-27422 Singhashutosh90 Sat, 28 May 2011 13:02:00 +0000 http://talkbinary.com/?p=1572#comment-27422 Can anyone please explain how recursion works in case of mergesort. MERGE-SORT(A, p, r )if p < r  Check for base casethen q ← (p + r)/2MERGE-SORT(A, p, q)  MERGE-SORT(A, q + 1, r )  MERGE(A, p, q, r ) In the above algo suppose array is {1,3,2,4,5}. So first mergesort(a,0,2) is passed then does execution proceeds to next line or it waits for result of mergesort(a,0,2). If it does wait then it will again pass (a,0,1) and so on... Please explain... Can anyone please explain how recursion works in case of mergesort.

MERGE-SORT(A, p, r )if p < r  Check for base casethen q ← (p + r)/2MERGE-SORT(A, p, q)  MERGE-SORT(A, q + 1, r )  MERGE(A, p, q, r )

In the above algo suppose array is {1,3,2,4,5}. So first mergesort(a,0,2) is passed then does execution proceeds to next line or it waits for result of mergesort(a,0,2). If it does wait then it will again pass (a,0,1) and so on…

Please explain…

]]> By: Diego http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-15647 Diego Wed, 10 Mar 2010 09:47:40 +0000 http://talkbinary.com/?p=1572#comment-15647 @Abby Thanks for coming. =) If you have anything else you'd like to see just let me know. I plan on visiting these tutorials and changing the structure a bit. @Abby

Thanks for coming. =) If you have anything else you’d like to see just let me know. I plan on visiting these tutorials and changing the structure a bit.

]]> By: abby http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-15269 abby Thu, 04 Mar 2010 01:58:50 +0000 http://talkbinary.com/?p=1572#comment-15269 ha this was helpful even though i've been through it many times.. thanks! ha this was helpful even though i’ve been through it many times.. thanks!

]]> By: Diego http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-4948 Diego Wed, 03 Jun 2009 06:00:57 +0000 http://talkbinary.com/?p=1572#comment-4948 Stay tuned, I'll be posting examples soon. Stay tuned, I’ll be posting examples soon.

]]> By: raja http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-4944 raja Wed, 03 Jun 2009 03:48:21 +0000 http://talkbinary.com/?p=1572#comment-4944 plz give me useful n easy example of recursion. plz give me useful n easy example of recursion.

]]> By: raja http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-27111 raja Wed, 03 Jun 2009 03:48:00 +0000 http://talkbinary.com/?p=1572#comment-27111 plz give me useful n easy example of recursion. plz give me useful n easy example of recursion.

]]> By: Diego http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-1542 Diego Mon, 23 Feb 2009 05:09:58 +0000 http://talkbinary.com/?p=1572#comment-1542 @Eric Yes, the worst mistake people tend to do is trying to solve or create recursive solutions in their head. That's why I recommend drawing things out by hand like the drawing I created. :) @Eric
Yes, the worst mistake people tend to do is trying to solve or create recursive solutions in their head. That’s why I recommend drawing things out by hand like the drawing I created. :)

]]> By: College Experience http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-1540 College Experience Mon, 23 Feb 2009 04:55:21 +0000 http://talkbinary.com/?p=1572#comment-1540 Recursion was really hard for me to understand at first. Just spend time writing out the algorithm and practice using it. It will be a lot simpler to understand =] Recursion was really hard for me to understand at first. Just spend time writing out the algorithm and practice using it. It will be a lot simpler to understand =]

]]> By: College Experience http://talkbinary.com/programming/c/introduction-to-recursion-in-c/comment-page-1/#comment-27110 College Experience Mon, 23 Feb 2009 04:55:00 +0000 http://talkbinary.com/?p=1572#comment-27110 Recursion was really hard for me to understand at first. Just spend time writing out the algorithm and practice using it. It will be a lot simpler to understand =] Recursion was really hard for me to understand at first. Just spend time writing out the algorithm and practice using it. It will be a lot simpler to understand =]

]]>