pseudo code for efficient multiplication of two sparse matrices

A sparse matrix is a matrix populated primarily with zeros.  Classical matrix multiplication is too inefficient for multiplying sparse matrices.  Write a pseudo code for efficient multiplication of two sparse matrices, i-by-j matrix A and j-by-k matrix B.