Respuesta :
There are several generally recognized algorithmic strategies. This strategy can be used depending on the objective objectives.
The Divide and Conquer Algorithm is a very popular algorithm in the world of Computer Science. Divide and Conquer is an algorithm that has the principle of breaking up a problem that is too big into several small parts so that it is easier to solve. The general steps of the Divide and Conquer algorithm:
- Divide: Divide the problem into several subproblems that are similar to the original problem but smaller in size (ideally about the same size).
- Conquer: Solve ( solve ) each effort problem ( recursively ).
- Combine: Combine the solutions of each sub-problem so as to form the original problem solution.
Greedy algorithm is a type of algorithm that uses a problem-solving approach by finding the maximum temporary value at each step. This temporary maximum value is known as the local maximum.
Kruskal’s algorithm is an algorithm in graph theory that finds a minimum spanning tree to connect in a weighted graph. This means finding the subset of edges that make up a tree that includes every vertex, where the total weight of all edges in the tree is minimized.
To know more about algorithm visit:
https://brainly.com/question/29458175
#SPJ4
