https://algorist.com/algowiki_v2/index.php?action=history&feed=atom&title=Talk%3ATADM2E_4.25Talk:TADM2E 4.25 - Revision history2026-05-01T05:19:27ZRevision history for this page on the wikiMediaWiki 1.28.0https://algorist.com/algowiki_v2/index.php?title=Talk:TADM2E_4.25&diff=326&oldid=prevJames Shi at 01:34, 28 April 20152015-04-28T01:34:54Z<p></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<col class='diff-marker' />
<col class='diff-content' />
<col class='diff-marker' />
<col class='diff-content' />
<tr style='vertical-align: top;' lang='en'>
<td colspan='2' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='2' style="background-color: white; color:black; text-align: center;">Revision as of 01:34, 28 April 2015</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l4" >Line 4:</td>
<td colspan="2" class="diff-lineno">Line 4:</td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>Creating there two arrays can be done in <math>O(xn) = O(nloglogn)</math>.</div></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"><div>Creating there two arrays can be done in <math>O(xn) = O(nloglogn)</math>.</div></td></tr>
<tr><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;"></td></tr>
<tr><td class='diff-marker'>−</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Finally, the array can be sorted in O(nloglogn).</div></td><td class='diff-marker'>+</td><td style="color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>Finally, the array can be sorted in <ins class="diffchange diffchange-inline"><math></ins>O(nloglogn)<ins class="diffchange diffchange-inline"></math></ins>.</div></td></tr>
</table>James Shihttps://algorist.com/algowiki_v2/index.php?title=Talk:TADM2E_4.25&diff=325&oldid=prevJames Shi: Created page with "I don't agree with that the time complexity is <math>O(n)</math> of the first step. The array <math>A'</math> has <math>x</math> numbers. If you want to find a number, you ca..."2015-04-28T01:34:26Z<p>Created page with "I don't agree with that the time complexity is <math>O(n)</math> of the first step. The array <math>A'</math> has <math>x</math> numbers. If you want to find a number, you ca..."</p>
<p><b>New page</b></p><div>I don't agree with that the time complexity is <math>O(n)</math> of the first step.<br />
<br />
The array <math>A'</math> has <math>x</math> numbers. If you want to find a number, you can do it in O(x), cause the array is not in order.<br />
Creating there two arrays can be done in <math>O(xn) = O(nloglogn)</math>.<br />
<br />
Finally, the array can be sorted in O(nloglogn).</div>James Shi