Breaking
Category

## Greedy

Category

Dijkstras algorithm is an algorithm for finding the shortest paths between nodes in a graph. Dijkstra’s Algorithm solves the single-source shortest path problem in weighted graphs. It is similar to Prims algorithm. Dijkstra algorithm can be used for graphs with all positive weight edges only. Dijkstra is not lacks distribute property.

Prime Algorithm helps to find minimum-spanning-tree. Prims algorithm is useful when a graph with lots of edges. It is significantly faster in the limit when dense graph with many more edges than vertices. Kruskal performs better in sparse graphs and it uses simpler data structures.

Selection sort is a sorting algorithm that divide into the sorted and unsorted part. It moves unsorted items to sorted array every step. Selection sort is an in-place comparison sort and faster than bubble sort.

An activity-selection is the problem of scheduling a resource among several competing activity. It is a mathematical optimization problem concerning the selection of non-conflicting activities to perform within a given time frame, given a set of activities each marked by a start time and finish time.

Huffman coding is a lossless data compression algorithm and derives this table based on the estimated frequency of occurrence for each possible value of the source symbol.

A job scheduler is a computer application for controlling unattended background program execution. Write a program to implement task…

Write a program to get the amount of money and display the count of each type. The coins displays quarters, dimes, nickels, and pennies.