Ruthsybel9754
Ruthsybel9754
10.01.2020 • 
Mathematics

Find a trivial lower-bound class for each of the following problems and indicate, if you can, whether this bound is tight.
a. finding the largest element in an array
b. checking completeness of a graph represented by its adjacency matrix
c. generating all the subsets of an n-element set
d. determining whether n given real numbers are all distinct

Solved
Show answers

Ask an AI advisor a question