Before
After
If this was intended, what's the idea behind this?
More 'readable'?
The change seems to be platform wide, but due to the white background color on SO it does not seem to have any useful addition.
Edit
After receiving an upvote, there seems to be more change to the styling:
The ...
Before
After
If this was intended, what's the idea behind this?
More 'readable'?
The change seems to be platform wide, but due to the white background color on SO it does not seem to have any useful addition.
Edit
After receiving an upvote, there seems to be more change to the styling:
The ...
For a 2 dimensional array we will define the elements in either the first row or the last column to be the largest "J-Bracket" of the array. For example in the following array elements in the J-bracket are highlighted:
\$
\begin{bmatrix}
\color{red}{\underline 1} & \color{red}{\underline 2} & \c...
Before
After
If this was intended, what's the idea behind this?
More 'readable'?
The change seems to be platform wide, but due to the white background color on SO it does not seem to have any useful addition.
Edit
After receiving an upvote, there seems to be more change to the styling:
The ...
CMQ I have a coding question....I have a list of triples (x, y, n) and I want to find if n is always larger when x and y are. In other words, do there exist two triples (x1, y1, n1) , (x2, y2, n2) such that n2< n1 but both x2>x1 and y2>y1. Can this be done faster than checking all pairs exhaustively?
@graffe In terms of actual performance I think you can get pretty good, but I don't think you can beat it in terms of theoretic asymptotic performance. e.g. lets consider an example where all elements can be split in two groups. Group A such that every (x,y) of A is incomparable to every other (x,y) of A. And group B the same but every element in group B is also larger than every element of A. To verify you need to compare every pair of n in A and n in B. Which is n^2 time.
However in the best case the time is limited by the square of the bucket size so in most cases you will have much smaller buckets and you can effectively get O(n) time.
granted i'll probably get used to it but it looks different without making any improvements and since the icons are more white they look like they have unread stuff