 |
Refer Listing To A Friend |
|
|
 |
SUGGEST Improve the performance of your Java code TO A FRIEND...
If you have a friend that you would like to recommend this page to,
or if you just want to send yourself a reminder, here is the easy
way to do it!
Simply fill in the e-mail address of the person(s) you wish to tell
about Improve the performance of your Java code, your name and e-mail address (so they do
not think it is spam and can reply to you directly with gracious thanks),
and click the SEND button.
If you want to, you can also enter a message that will be included
on the e-mail.
After sending the e-mail, you will be transported back to the
page you recommended!
| Resource Title: |
Improve the performance of your Java code |
| URL: | [CLICK HERE] |
| Description: |
Many algorithms are expressed most concisely as tail-recursive methods. Compilers can automatically transform such methods into loops and thereby improve program performance, but this transformation is not required by the Java language specification, so not all JVMs will perform it. This means that tail-recursive methods in the Java language can result in unexpectedly large memory usage. This article demonstrates that dynamic compilation maintains the language's semantics while static compilation often doesn't. Learn why this matters and get a bit of code to help you determine whether your just-in-time (JIT) compiler can transform tail recursion on code while preserving semantics.
| |
|
|
|
|
|
