Lec 34 Java Fundamental of Computing
Lec 34 Java Fundamental of Computing
I Semester 2008-09
Lecture 34
1
Tower of Hanoi
2
Tower of Hanoi
3
Design a method Tower of Hanoi(n)
which prints the detailed instruction about the movement of discs in order to
transfer n discs from A to B .
4
Search
5
Search
6
Search
7
Binary Search : A powerful search algorithm
8
Input Output from/to Console
Classes used :
• InputStreamReader
• BufferedReader
An interactive program for sorting numbers
see the file selection sort i.java
9
Input Output from/to Console
10
Input Output from/to File - without buffers
11