Count-distinct problem: Difference between revisions

Content deleted Content added
Pychron (talk | contribs)
m fixed and explained the last step D6 of the algorithm D
Pychron (talk | contribs)
m typo
Line 66:
insert <math> (a_t, u) </math> in {{mvar|B}}
else
<math>(a',u')</math> such that <math>u' = \max_{u''}max\{u'':(a'',u'')\in B, \forall a''\}</math> /* the element <math>(a',u')</math> whose <math>u'</math> is maximum in {{mvar|B}} */
If <math> u > u' </math> then
<math>p\leftarrow u</math>