Comments for Jonathan Landrum

Comment on Calculating Factorials with a Recursive Function by Fun With Permutations :: Jonathan Landrum

Fun With Permutations :: Jonathan Landrum — Wed, 02 May 2012 02:23:31 +0000

[...] from “B” to “F” there are. That is as simple as calculating 5! using the factorial() method we’ve come to know and love.That’s our first number, now we need to find our second [...]

Comment on Adding the Prime Numbers Less Than 2,000,000 by Inductive Reasoning with Recursion :: Jonathan Landrum

Inductive Reasoning with Recursion :: Jonathan Landrum — Mon, 16 Apr 2012 23:02:29 +0000

[...] the induce() function. The former is an exact duplicate of that used in Computing the nth Prime and Adding the Prime Numbers Less Than 2,000,000. The latter function had to be written from scratch. Fortunately, it’s a trivial function. To [...]

Comment on Computing the nth Prime by Inductive Reasoning with Recursion :: Jonathan Landrum

Inductive Reasoning with Recursion :: Jonathan Landrum — Mon, 16 Apr 2012 21:37:17 +0000

[...] “prime”), and the induce() function. The former is an exact duplicate of that used in Computing the nth Prime and Adding the Prime Numbers Less Than 2,000,000. The latter function had to be written from [...]

Comment on Solving the Quadratic Equation with Fortran (With Complex Roots) by Jonathan

Jonathan — Thu, 12 Apr 2012 04:08:16 +0000

You’re very welcome! Thanks for visiting!

Comment on Java Sentence Reverser by Making a Queue From a Stack :: Jonathan Landrum

Making a Queue From a Stack :: Jonathan Landrum — Tue, 10 Apr 2012 23:35:43 +0000

[...] Having done all of my data structure programming in Java, I am pleased to begin creating these same structures in C. This program worked flawlessly as [...]

Comment on Using a Stack to Make a Checkbook Ledger by Making a Queue From a Stack :: Jonathan Landrum

Making a Queue From a Stack :: Jonathan Landrum — Tue, 10 Apr 2012 23:34:38 +0000

[...] We’ve used stacks twice now (“Writing a Drop-Out Stack” and “Using a Stack to Make a Checkbook Ledger”), and they have already proved quite useful. Since a stack is so similar to a queue, let’s explore turning our stack into one [...]

Comment on Writing a Drop-Out Stack by Making a Queue From a Stack :: Jonathan Landrum

Making a Queue From a Stack :: Jonathan Landrum — Tue, 10 Apr 2012 23:31:30 +0000

Comment on Writing a Drop-Out Stack by Using a Stack to Make a Checkbook Ledger :: Jonathan Landrum

Using a Stack to Make a Checkbook Ledger :: Jonathan Landrum — Tue, 10 Apr 2012 04:22:49 +0000

[...] The other day I wrote you about using a stack to make an undo button, and now I want to show you how you can use a stack to keep up with a running total in a ledger [...]

Comment on Solving the Quadratic Equation with Fortran (With Complex Roots) by Turkishfather

Turkishfather — Sat, 07 Apr 2012 21:39:49 +0000

Thank you man.My field is mechanical engineering.I’m a university student.We’ve studied fortran 90 and i always spend my time on your website.I’d like to thank you for all.

Comment on What Sigma Notation Means to a Computer Scientist by Perfecting Combinatorics :: Jonathan Landrum

Perfecting Combinatorics :: Jonathan Landrum — Mon, 02 Apr 2012 19:02:58 +0000

[...] us after an iteration. And that’s just what we’ve got. This is an algorithm similar to sigma notation, only in this case we multiply in each cycle of the loop rather than add. By placing this set of [...]