Which data structure is commonly used to implement Horner's method for polynomial evaluation?Question 1 Answer

Horner's method is commonly implemented using an array or a linked list data structure.

1. Array: An array can effectively store the coefficients of the polynomial, allowing for efficient access during the evaluation. The coefficients are stored in decreasing order of their powers, and Horner's method is applied in a straightforward linear fashion through the array.

2. Linked List: Alternatively, a linked list can be used to represent the polynomial where each node contains a coefficient and its corresponding power. This approach allows for dynamic memory allocation, which can be beneficial for polynomials of varying degree.

In summary, both arrays and linked lists are suitable data structures for implementing Horner's method, with the choice depending on the specific requirements of the application.