算法Let1-Introduction.pptVIP

* What can you learn from this course? A list of algorithms. Learn their code. Trace them until you are convinced that they work. Implement them. Worry about details. class InsertionSortAlgorithm extends SortAlgorithm { void sort(int a[]) throws Exception { for (int i = 1; i a.length; i++) { int j = i; int B = a[i]; while ((j 0) (a[j-1] B)) { a[j] = a[j-1]; j--; } a[j] = B; }} * A survey of algorithmic design techniques. Abstract thinking. How to develop new algorithms for any problem that may arise. A survey of algorithms analysis techniques. What can you learn from this course? * About Your Learning Read Ahead You are expected to read the lecture notes before the lecture. This will facilitate more productive discussion during class. Like in an English class Also please proof readassignments  tests. * Useful Learning Techniques Day Dream Mathematics is not all linear thinking. Allow the essence of the material to seep into your subconscious Pursue ideas that percolate up and flashes of inspiration that appear. While going along with your day * Useful Learning Techniques Be Creative Ask questions. Why is it done this way and not that way? * Useful Learning Techniques Guesses and Counter Examples Guess at potential algorithms for solving a problem. Look for input instances for which your algorithm gives the wrong answer. Treat it as a game between these two players. * Useful Learning Techniques Refinement:The best solution comes from a process of repeatedly refining and inventing alternative solutions Software School of XiDian University Software School of XiDian University * Design and Analysis of AlgorithmsIntroduction(Ch1) School of Computer Science and Technology 郭杏莉 * Contact 郭杏莉 mail xlguo@ guoxingli.xd@ office 北校区主楼1区436 电话 * Textbook * Fina