https://github.com/basemax/sparsepolynomiallinkedlistc

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.

algorithm algorithms algorithms-and-data-structures c c-polynomial c-sparse-polynomial c-sparsepolynomial datastructure ds polynomial polynomial-c sparse sparse-polynomial sparse-polynomial-c sparsepolynomial sparsepolynomial-c

Last synced: 03 Apr 2025