(data structure)

**Definition:**
A *matrix* having irregular numbers of items in each row.

**See also**
*uniform matrix*, *sparse matrix*.

*Note:
An upper triangular matrix or a lower triangular matrix are usually not thought of as being ragged since the number of items in each row is regular (changing by one from row to row).
*

* For example *

1 | 16 | 18 | 9 | 12 |

6 | ||||

1 | 8 | 3 | 0 |

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.

HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:

Paul E. Black, "ragged matrix", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/raggedmatrix.html