We have that the appropriate statement will be
- An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time
III only.
Option B
From the question we are told
Consider the following <u>algorithms</u>. Each <u>algorithm</u> operates on a list containing n <em>elements</em>, where n is a very large <u>integer</u>.
I. An algorithm that accesses each <u>element</u> in the list twice.
II. An <em>algorithm </em>that accesses each <u>element </u>in the list n times.
III. An <u>algorithm</u> that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the <em>algorithms </em>run in <em>reasonable </em>time?
<h3>
Algorithm </h3>
Generally In order to get <em>admission </em>to every thing in the list twice, the algorithm has to traverse the listing twice,
which leads to 2*n entry to operations.
And if the every factor is accessed n times, the listing will be traversed n time, which leads to n^2 get right of entry to operations.
If n is a very giant <em>integer</em>, each 2*n and n^2 are plenty larger.
So, there will be <em>solely </em>ten entry to operations and this algorithm will have a sensible jogging time.
Therefore
An algorithm that accesses only the first 10 elements in the list, regardless of the size of the list. Which of the algorithms run in reasonable time
III only.
Option B
For more information on algorithm visit
brainly.com/question/950632
