[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.

[KC]

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

_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe