# Sparse Matrices, Two-Dimensional Matrices and Lists

Not what you're looking for?

One of the problems of storing data in a matrix (a two-dimensional Cartesian structure) is that if not all of the elements are used, there might be quite a waste of space. In order to handle this, we can use a construct called a "sparse matrix", where only the active elements appear. Each such element is accompanied by its two indexes (the row and the column). Discuss in what ways such a structure is similar to and/or different than a list.

##### Purchase this Solution

##### Solution Summary

This solution describes the advantages of using sparse matrices over two-dimensional matrices, apart from exploring the differences between lists and sparse matrices.

##### Purchase this Solution

##### Free BrainMass Quizzes

##### C# variables and classes

This quiz contains questions about C# classes and variables.

##### Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

##### Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

##### Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

##### C++ Operators

This quiz tests a student's knowledge about C++ operators.