This is a C implementation of a sparse polynomial linked-list. This is a good example of how to use a linked-list in C. By using a linked-list, we can store a sparse polynomial in a memory efficient way. Sparse polynomials are polynomials that have a lot of terms with a coefficient of 0.
c algorithm algorithms sparse polynomial datastructure ds algorithms-and-data-structures sparse-polynomial sparsepolynomial c-polynomial polynomial-c sparsepolynomial-c c-sparsepolynomial c-sparse-polynomial sparse-polynomial-c
- Updated
Dec 10, 2022 - C