Skip to main content

Blog Archive for mortazavi during August 2005

If you have any doubts about the value of chatting and listening to them, it might satisfy you to know that chatting brings to fore an ancient method of teaching, which was tried by Plato in his dialogues. In any case, I learned a thing or two reviewing this little chat among some MIDP and Netbeans Mobility Pack experts.
Introduction to the Java Programming Language remains the top course offered at the ACM Professional Development Centre, for the year and for the month of May. (The August issue of Communications of the ACM has the survey for the month of May and for the year ending in May.) Beginning to Program with the Java Programming Language, the 10th for the year, has risen to the 4th most popular course...
When describing and praising recursive algorithms, I gave an example for solving the Tower of Hanoi puzzle. The curious among you may have done a simple, back of the envelope, complexity analysis. It turns out that the time complexity of the algorithm is exponential. It is order of 2 ^ n. In the real world, a puzzle of 64 disks will take 584 billions years to solve the puzzle if the priest...
I've done a lot of recursive programming in Java. I like recursion. That's my weakness. Why? I don't know. Perhaps because I spent a good many years of my life studying logic and methodology of science at Berkeley. There's just a certain beauty to it. So, after many years of logic, when I took a course in LISP, I grew an admiration for it. However, that didn't stop me there. I moved to...
Lewis & Chase's (not Lewis and Clark's) Java: Software Structures—designing & using data structures, 2nd edition seems like an excellent book. If you want to take another look at Java, this no-nonsense book demands a peak, and I'm puzzled why they have received such a low rating by Amazon readers. By the way, I've written a bit about programming on my blogs.sun.com page.