Question

in Data structures, which of these algorithms provides an optimal time solvable solution?
​

Answer 1

Answer:

Data Structures and Algorithms: Hard Problems. If a problem has an O(nk) time algorithm (where k is a constant), then we class it as having polynomial time complexity and as being efficiently solvable.

Hope it helps you dear

Answer 2

in Data structures, SET COVERS algorithms provides an optimal time solvable solution.

About SET COVERS Algorithm :

• Set covers the algorithm that offers a solvable answer in the shortest amount of time.
• The set covering issue seeks to determine the smallest number of sets that include (cover) all of the items given a set of elements.
• The aim is to discover a set covering that employs the fewest sets. It is a problem "whose research has led to the creation of essential approaches for the whole area" of approximation algorithms. Set covering is NP-complete in the decision version and NP-hard in the optimization/search version.