1. Write a program to sort a list of N elements using selection sort technique.
2. Write a program to perform Travelling Salesman problem. 3. Write a program to implement dynamic programming algorithm for 0/1 knapsack problem. 4. Write a program to fin maximum and minimum values in array using divide and conquer. 5. Test program to implement divide and conquer strategy. 6. Program to implement quick sort and run the program for varied values. 7. A C program that accepts the vertices and edges for a graph and store it as an adjacency matrix. 8. A program to implement backtracking algorithm for sum of subset problems. 9. A program to implement prims algorithm to generate minimum cost spanning tree. 10. Program to implement backtracking algorithm for solving problems like N queue.