[ Home | Jit Sengupta]
Algorithms ... Hashing ... Efficiency - its like three keywords of a technical white paper picked up by a keyword extracter. They are somewhat the same, and they are related, but at the same time, people need to know how the relationship is built. To me, an algorithm is just a strategy of solving a problem in a systematic approach. Efficiency tells you how good the algorithm is - how well does it scale. And Hashing is one super cool algorithm that shows the limit of efficiency in terms of insert/delete/find operations in a list. In this session, I will present a quick overview of developing algorithms as a problem-solving strategy, talk about efficiency of algorithms, and quickly discuss Hashing as a way of achieving really efficient insert/delete/find method.
This session will cover the following topics:
I have the lecture notes for this session as a powerpoint presentation, available from: jett3-jit.ppt.
Here are some samples that we may or may not use in the class. I will assume that everyone has access to Dr. Java - you may want to download the samples in your own workspace before we begin.