Home Work 1

Algorithm Lab (03-10-19)-cum-Home Work.
Ashulia: Section C
Due Date: 07-10-19

Total Points: 15
----------------------------------------------------
1. Compare Between Bubble Sort and Selection Sort with source code.

2. Write a program to pass three integer values from one array(A) to another(B) using tower of hanoi algorithm.

3. Topological Sort(Graph Theory):
------------------------------------------
John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is
only possible if other tasks have already been executed.
Input:
The input will consist of several instances of the problem. Each instance begins with a line containing
two integers, 1 ≤ n ≤ 100 and m. n is the number of tasks (numbered from 1 to n) and m is the number of
direct precedence relations between tasks. After this, there will be m lines with two integers i and j,
representing the fact that task i must be executed before task j.
An instance with n = m = 0 will finish the input.
Output :
For each instance, print a line with n integers representing the tasks in a possible order of execution.
Sample Input
----------------
5 4
1 2
2 3
1 3
1 5
0 0
Sample Output
1 4 2 5 3