i can tell 1 thing tht only (((n*n)-n)/2) +n elements are unique and the "(((n*n)-n)/2)" term is the one shoes the no of repeated elements and n represents the diagonal elements hope this gives some usefull info (i havent gone through any book nor do i guarantee optimal or best memory usage)
On Wed, Jan 12, 2011 at 9:50 AM, Azhar Hussain <azhar...@gmail.com> wrote: > I have a symmetric matrix. I am wondering what would be the best data > structure to store such a matrix? How many elements do I need to store for a > nxn matrix? > > Thanks in advance for the help. > > - > Azhar. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Ehab Abdul Rahman Shariff -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
