Explain why the Java dynamic dispatch algorithm, which looks for the method to invoke for a call o.a(), will never get into
an infinite loop.
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
Explain why the Java dynamic dispatch algorithm, which looks for the method to invoke for a call o.a(), will never get into
an infinite loop.
Did you just copy and paste your homework question here? That isn't how this works. What have you tried? Where are you stuck?
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
And can you describe this algorithm - say what it does, and describe how it does it?
...and...
Post the related code and explain why you think it WILL get into an infinite loop.