tag:blogger.com,1999:blog-6314876008291942531.post3138123018938554433..comments2024-01-14T00:36:43.430-08:00Comments on Antonio Gulli's coding playground: 0/1 matrixUnknownnoreply@blogger.comBlogger3125tag:blogger.com,1999:blog-6314876008291942531.post-11513709152324226772011-05-31T05:38:56.347-07:002011-05-31T05:38:56.347-07:00We can sort it, but this doesn't change the ar...We can sort it, but this doesn't change the argument that any algorithm will have to read all the matrix elements.<br /><br />Or are you saying that it's somehow sorted initially?Anonymoushttps://www.blogger.com/profile/16234740155371832738noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-41983297169589398272011-05-31T02:14:36.654-07:002011-05-31T02:14:36.654-07:00how about sorting it?how about sorting it?codingplaygroundhttps://www.blogger.com/profile/08478993186814330588noreply@blogger.comtag:blogger.com,1999:blog-6314876008291942531.post-10979504052404525732011-05-29T12:35:45.515-07:002011-05-29T12:35:45.515-07:00How are we measuring the quality of a solution? If...How are we measuring the quality of a solution? If it's the usual worst-case asymptotic time complexity, then you can't go below O(n^2).Anonymoushttps://www.blogger.com/profile/16234740155371832738noreply@blogger.com