A companion tutorial to the previous video, learn how the instructor solved for the challenge of printing a LinkedList in reverse order.
(echoed ringing sound)…- [Instructor] Welcome back.…How did you make out with the challenge?…Hopefully you realize it's not that difficult,…but I hope you had a chance to try it,…and maybe even make a few errors along the way.…Sometimes that's the best way to learn.…To make it a little more challenging,…I'm going to update my original linked list example…to store words instead of numbers.…I need to update my Node.java,…and I'm just going to change the value here…from an integer to a string,…that way I can do names, or I can do fruit,…or cars, or whatever I feel like.…
All right, so I need to change a couple things.…I need to change this, as well.…There we go.…Now, if I go back over to my linked list,…I'm going to have some errors here,…because when I'm creating the new nodes,…it's giving 'em a number,…so let's go ahead, and let's do vehicle names.…Let's try that.…I'm going to do Jeep Wrangler as my first node,…and then I'll do a Ford F150,…which is a truck,…and then let me do a Nissan,…I think maybe a Sentra is a name of one,…
Programmers involved in mathematical computations, such as mathematical induction, are probably the biggest users of recursion. You probably know some of the most common recursive problems; finding the factorial of a number and the Fibonacci series are both examples of recursive processes. In this course, staff instructor and Java expert Peggy Fisher explores programming solutions involving both of these problems. She reviews the concept of recursion, discusses approaches to solving problems using recursion, and examines some recursive examples.
- Explain how many steps it will take to move four disks in Towers of Hanoi.
- Describe the process of printing a LinkedList
- Review how to write a power function.
- Define recursion.
- Identify recursive examples.