Question

Prove that the running time of an algorithm is θ (g(n)) if and only if its worst-case running timeis ο(g(n)) and its best-case running time is ω(g(n)).

Answer 1

Suppose the population of the world is 6 billion, and that there is an average of 1000 communicating devices per person. how many bits are required to assign a unique host address to each communicating device? suppose that each device attaches to a single network and that each network on average has 10000 devices. how many bits are required to provide unique network ids to each network?