Question

1. In Lesson 1, algorithm's complexity is measured on input size instead of input values. Please indicate the input size for an algorithm that solves the following problem: Given: a number $n$ and two primes $p$, $q$, Question: is it the case that $n = p \cdot q$? In Lesson 2, we learned linear-time selection algorithm where the input array of numbers are cut into groups of size 5. Show that, when the group size is 7, the algorithm still runs in linear time.

          1. In Lesson 1, algorithm's complexity is measured on input size instead of
input values. Please indicate the input size for an algorithm that solves the
following problem:
Given: a number $n$ and two primes $p$, $q$,
Question: is it the case that $n = p \cdot q$?
In Lesson 2, we learned linear-time selection algorithm where the input
array of numbers are cut into groups of size 5. Show that, when the group
size is 7, the algorithm still runs in linear time.

1. In Lesson 1, algorithm's complexity is measured on input size instead of
input values. Please indicate the input size for an algorithm that solves the
following problem:
Given: a number n and two primes p, q,
Question: is it the case that n = p · q?
In Lesson 2, we learned linear-time selection algorithm where the input
array of numbers are cut into groups of size 5. Show that, when the group
size is 7, the algorithm still runs in linear time.

Added by Leslie W.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Reynald Oliveria

Step 1

This is because the complexity of the algorithm would depend on the number of bits in the input, rather than the actual value of the input. For the second problem, the input size would be the number of elements in the input array. This is because the complexity Show more…

Show all steps

Thanks for your feedback!

Indicate the input size for an algorithm that solves: l. In Lesson 1, algorithm's complexity is measured on input size instead of input values. Please indicate the input size for an algorithm that solves the following problem: Given: a number n and two primes p,q Question: is it the case that n = pq? In Lesson 2, we learned linear-time selection algorithm where the input array of numbers are cut into groups of size 5. Show that, when the group size is 7, the algorithm still runs in linear time.