![]() Approach: The idea is to consider all events in sorted order.Two nested loops traverse the array, so the time complexity is O(n^2). Output Minimum Number of Platforms Required = 3 Activity Selection Problem | Greedy Algo-1.Write a program to print all permutations of a given string.Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2.Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5.Dijkstra's shortest path algorithm | Greedy Algo-7.Bell Numbers (Number of ways to Partition a Set).Sort a nearly sorted (or K sorted) array.k largest(or smallest) elements in an array.K’th Smallest/Largest Element using STL.K’th Smallest/Largest Element in Unsorted Array | Set 3 (Worst Case Linear Time).K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time).K’th Smallest/Largest Element in Unsorted Array | Set 1.Reverse an array in groups of given size.Minimum Number of Platforms Required for a Railway/Bus Station.K Centers Problem | Set 1 (Greedy Approximate Algorithm).Greedy Algorithm to find Minimum number of Coins.Find minimum number of coins that make a given value. ![]() ![]() ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
March 2023
Categories |