C++实现的稀疏矩阵类,可实现稀疏矩阵的存储计算等功能-Now, instead of using 2D, we will use doubly-linked lists to present sparse matrices. There are various methods of organizing doubly-linked-lists. We not only store elements of sparse matrices but also implement operations

Linked List and Array Read String and print them

基于牛顿迭代法的多项式求根程序，使用的数据结构是链表-Newton iterative method based on polynomial root-finding programs, data structures using a linked list