Analysis The Time Complexity of Greedy Algorithm Used in Optimization 1 Yogesh Chanchal, 2 Dr. Ashendra Kumar Saxena

Abstract- My idea behind this research is to find a new greedy way to find the optimal solution in Euclidean space.Today we face many real life complex problems, to solve real life of complex problem we developed a new greedy approach in minimum time. Here we have find the time complexity of algorithm (Kruskal, Prims, Dijkastra, Tsp) and have compared following algorithms with each other. Our main goal to find the best case time complexity for both Minimum Spanning Tree (MST) and Single Source Shortest Path (SSST).Both Approaches MST and SSSP have been used in greedy approach. In this research paper, we have developed same way for same approach with reduced time complexity which provides best case time complexity for any weighted graph in Euclidean space. We have developed an algorithm that manipulates the greedy approach for a set of n points in a metric space with corresponding doubling dimension. Suppose G (V, E, w) is a simple graph where V denotes a set of Vertices in a given graph and E denotes set of edges of a graph and vertices are connected with edges. All edges having non negative weight which also represent distance between two nodes in a given graph. To remember greedy approach as we developed a new greedy approach to find the shortest route among nodes or vertices. Which gives an optimal way in minimum time among nodes or vertices? Here we have worked the concept of MST and SSSP. Simply this research is based on combinatorial optimization and focused to find the optimum solution of various types of general problems