テック クリ Tech Kuri
Geeky reflections
Friday, September 14, 2007
An interesting puzzle
Stack Growth : How would you find out if a machine’s stack grows up or down in memory?
I found this person's
solution
quite interesting..
Labels:
puzzle
posted by kuri* at
8:57 PM
0
Comments:
Post a Comment
<< Home
Links
main blog
manga reviews
frivolous blog
my site is partially back up
Previous Posts
extreme programming, kind of
an article on unicode
debugging your java classpath
practice test take 1
Programming is so much fun
seeking wireless headset recommendations
Japanese text editor
Java: Processes and Threads
Java: bounded wildcards
Java: regular expressions
0 Comments:
Post a Comment
<< Home