Study on Selected Greedy Algorithms

Abstract

We studied some Greedy Algorithms, implemented to observe the in depth functionalities. We used the main idea of Knapsack problem to solve some problems which are inspired by real life applications. Afterwards we thought of implementing MST with Genetic Algorithm. Genetic Algorithm is one of the most evolutionary methods in the field of computer science for solving optimization problem. With the help of Genetic Algorithm we designed an algorithm that makes it possible to solve MST problems more efficiently