The given algorithm runs nx logn operations on input size n. Assume that the given algorithm...

Transcribed Image Text:

The given algorithm runs nx logn operations on input size n. Assume that the given algorithm runs 3600×10⁰⁰ operations in one hour. So, it can be written as: nxlogn=3600x10⁰⁰ logn" =36×10¹² n" = 236x10¹2 n=√√23 236×10¹2 Hence, the largest required input size, = 236x10¹2 36x10¹²90.632×10¹0. n= The given algorithm runs nx logn operations on input size n. Assume that the given algorithm runs 3600×10⁰⁰ operations in one hour. So, it can be written as: nxlogn=3600x10⁰⁰ logn" =36×10¹² n" = 236x10¹2 n=√√23 236×10¹2 Hence, the largest required input size, = 236x10¹2 36x10¹²90.632×10¹0. n=

Answer rating: 100% (QA)

Based on the given algorithm which runs n logn operations on an input size of 3600 1010 we ... View the full answer