Question

Which algorithm has best asymptotic runtime complexity?

Answer 1

Answer:

When the IP address is booted, the following host is used by the IP address:

The IP address 0.0.0.0 So, the above discussed is basically the IP address.

The following host is used by the IP address when the following address of the IP is booted.

So, the IP address is basically 0.0.0.0.

Answer 2

Explanation:

For Best case Insertion Sort and Heap Sort are the Best one as their best case run time complexity is O(n). For average case best asymptotic run time complexity is O(nlogn) which is given by Merge Sort, Heap Sort, Quick Sort. For Worst Case best run time complexity is O(nlogn) which is given by Merge Sort, Heap Sort.