Question

in data structures which of these algorits provides an optial tie 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.

Answer 2

Answer:

date structures and algorithms; Hard problems. if a problem has an o time algorithm then we class it as haveing polynomial time complexity and as being efficiently solveble.