Datenstrukturen: Unterschied zwischen den Versionen

Aus Das Sopra Wiki
Dietsch (Diskussion | Beiträge)
Dietsch (Diskussion | Beiträge)
Zeile 258: Zeile 258:


=== ein-elementige Datenstrukturen  ===
=== ein-elementige Datenstrukturen  ===
{| class="default"
{| class="default"
|-
|-
Zeile 278: Zeile 279:
! Clear
! Clear
   
   
! Count  
! Count
 
|-
|-
! [http://msdn.microsoft.com/en-us/library/bb359438.aspx HashSet<T>]
! [http://msdn.microsoft.com/en-us/library/bb359438.aspx HashSet<T>]
   
   
| O(1)<br>O(n) wenn Count + 1 &gt; Capacity
| 10ms / 4ms
   
   
| O(1)
| 4ms
   
   
| O(n)
| 48.240ms
   
   
| O(1)
| 4ms
   
   
| O(n)
| 0ms
| class="close" | O(1)
   
   
| class="close" | 0ms
|-
|-
! [http://msdn.microsoft.com/en-us/library/he2s3bh7.aspx LinkedList&lt;T&gt;]
! [http://msdn.microsoft.com/en-us/library/he2s3bh7.aspx LinkedList&lt;T&gt;]
   
   
| O(1)
| 7ms
| 28.883ms
| O(1)
| 63.349ms
| 58.970ms
| O(n)
| 0ms
| class="close" | 0ms
| O(n)
| O(n)
| class="close" | O(1)
|-
|-
! [http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx List&lt;T&gt;]
! [http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx List&lt;T&gt;]
   
   
| O(1)<br>O(n) wenn Count + 1 &gt; Capacity
| 2ms
   
   
| O(n)
| 5848ms
| 2ms
| O(1)
| 61.034ms
| 0ms
| O(n)
| class="close" | 0ms
| O(n)
| class="close" | O(1)
 
|-
|-
! [http://msdn.microsoft.com/en-us/library/7977ey2c.aspx Queue&lt;T&gt;]
! [http://msdn.microsoft.com/en-us/library/7977ey2c.aspx Queue&lt;T&gt;]
   
   
| O(1)<br>O(n) wenn Count + 1 &gt; Capacity
| 2ms /&nbsp;1ms
   
   
| O(1)<br>
| 1ms<ref name="removefirst">Diese Datenstruktur unterstüztzt nur das Entfernen des ersten Elements, d.h. in diesem Test wurde n-mal das erste Element entfernt.</ref><br>
   
   
| O(n)<br>
| 76.947ms<br>
   
   
| O(n)<br>
| 204.310ms<br>
   
   
| O(n)<br>
| 0ms<br>
   
   
| class="close" | O(1)<br>
| class="close" | 0ms<br>
 
|-
|-
! [http://msdn.microsoft.com/en-us/library/3278tedw.aspx Stack&lt;T&gt;]
! [http://msdn.microsoft.com/en-us/library/3278tedw.aspx Stack&lt;T&gt;]
   
   
| O(1)<br>O(n) wenn Count + 1 &gt; Capacity <br>
| 1ms <br>
   
   
| O(1)<br>
| 1ms<ref name="removefirst" /><br>
   
   
| O(n)<br>
| 53.155ms<br>
   
   
| O(n)<br>
| 192.108ms<br>
   
   
| O(n)<br>
| 0ms<br>
   
   
| class="close" | O(1)<br>  
| class="close" | 0ms<br>
 
|-
|-
! [http://msdn.microsoft.com/en-us/library/ms668265.aspx SynchronizedCollection&lt;T&gt;]
! [http://msdn.microsoft.com/en-us/library/ms668265.aspx SynchronizedCollection&lt;T&gt;]
   
   
| O(1)<br>O(n) wenn Count + 1 &gt; Capacity<br>
| 8ms /&nbsp;7ms<br>
   
   
| O(n)<br>
| 101.157ms<br>
   
   
| O(1)<br>
| 9ms<br>
   
   
| O(n)<br>
| 59.859ms<br>
   
   
| O(n)<br>
| 0ms<br>
   
   
| class="close" | O(1)<br>
| class="close" | 0ms<br>
 
|}
|}