I tried to search the answer and I found that method cs_multiply from this book has been adopted for the purpose of multiplication of two general sparse matrices in MATLAB.
In the book it says that
"The time taken by this method
(A * B) is
O(n + f +|B|), where
f is the number of floating-point operations performed (
f dominates the run time unless
A has one or more columns with no entries, in which case either
|B| can be greater than f)"
So what does this
|B| stand for? What should be the runtime complexity in Big-O notation?
Any help will be appreciated.Thanks in advance