[Haskell-cafe] I can see lists "working" for matrix algorithms if the access patterns are mostly from the start or end of rows and columns.

Are there any such matrix algorithms that operate mainly from the start or end or rows and columns? Note: If the access pattern starts from the end of a row then one stores the row in reverse order in a list. -- -- Regards, KC