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
Generally The algorithm must traverse the listing twice in order to gain access to everything in the list twice. This results in the operations entry 2*n.
Additionally, if a given component is used n times, the list will need to be traversed n times, resulting in n2 access operations.
Each 2*n and n2 is significantly larger if n is a really large integer. Thus, this algorithm will only require ten entry-level operations and run quickly.
An algorithm is a process used to carry out a computation or solve a problem. In either hardware-based or software-based routines, algorithms function as a detailed sequence of instructions that carry out predetermined operations sequentially.
Learn more about algorithm:
brainly.com/question/24953880
#SPJ4
