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.
https://github.com/basemax/sparsepolynomiallinkedlistc

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: 2 days ago
JSON representation

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.

• Host: GitHub
• URL: https://github.com/basemax/sparsepolynomiallinkedlistc
• Owner: BaseMax
• License: gpl-3.0
• Created: 2022-12-10T12:51:43.000Z (about 2 years ago)
• Default Branch: main
• Last Pushed: 2022-12-10T13:12:23.000Z (about 2 years ago)
• Last Synced: 2025-02-04T07:15:41.671Z (7 days ago)
• Topics: 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
• Language: C
• Homepage:
• Size: 54.7 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0

Awesome Lists containing this project