Question

Which of the softing algorithms doesnt have a worst case rnning time?

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?

Answer 2

Answer:

Insertion, Quick and bubble all have worst case time complexity of O(n2). Only merge sort has the worst case running time of O(nlogn).