I'm new to the formal study of analyzing algorithms. Questions for any reader with even a modicum of experience - thanks in advance for any feedback!
1) What tools and techniques do you utilize when analyzing algorithms? Is your preferred way to draw box-and-pointer diagrams out on paper, for instance, or are there computer tools that you use; if so, which one(s)? 2) What prototype languages do you prefer when testing algorithms? For instance, the academic community really embraces Scheme for this purpose. Or do you skip prototyping languages altogether and jump straight to the target language, which usually has more overhead involved in setting up and testing simple examples.
