Datenstrukturen: Unterschied zwischen den Versionen
Aus Das Sopra Wiki
Keine Bearbeitungszusammenfassung |
|||
| Zeile 46: | Zeile 46: | ||
| O(1) | | O(1) | ||
| | | O(n) | ||
| O(1) | | O(1) | ||
| Zeile 62: | Zeile 62: | ||
! [http://msdn.microsoft.com/en-us/library/he2s3bh7.aspx LinkedList<T>] | ! [http://msdn.microsoft.com/en-us/library/he2s3bh7.aspx LinkedList<T>] | ||
| O(1) | | O(1) | ||
| O(1) | | O(1) | ||
| O(n) | | O(n) | ||
| O(n) | | O(n) | ||
| O( | | O(n) | ||
| O(1) | | O(1) | ||
| T | |||
| | | Nein | ||
| class="close" | | |||
| class="close" | | |||
|- | |- | ||
! [http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx List<T>] | ! [http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx List<T>] | ||
| O(1)<br>O(n) wenn Count + 1 > Capacity | | O(1)<br>O(n) wenn Count + 1 > Capacity | ||
| O(n) | | O(n) | ||
| O(1) | | O(1) | ||
| O(n) | | O(n) | ||
| O(n) | |||
| | | O(1) | ||
| | | T | ||
| | | Nein | ||
| class="close" | | |||
| class="close" | | |||
|- | |- | ||
! [http://msdn.microsoft.com/en-us/library/7977ey2c.aspx Queue<T>] | ! [http://msdn.microsoft.com/en-us/library/7977ey2c.aspx Queue<T>] | ||
| O(1)<br>O(n) wenn Count + 1 > Capacity | | O(1)<br>O(n) wenn Count + 1 > Capacity | ||
| <br> | | O(1)<br> | ||
| <br> | | O(n)<br> | ||
| <br> | | O(n)<br> | ||
| <br> | | O(n)<br> | ||
| <br> | | O(1)<br> | ||
| T<br> | | T<br> | ||
| Zeile 118: | Zeile 118: | ||
| Nein<br> | | Nein<br> | ||
| class="close" | | | class="close" | | ||
Remove und Add sind Deqeue und Enqueue | |||
|- | |- | ||
! [http://msdn.microsoft.com/en-us/library/3278tedw.aspx Stack<T>] | ! [http://msdn.microsoft.com/en-us/library/3278tedw.aspx Stack<T>] | ||
| Zeile 159: | Zeile 161: | ||
| class="close" | | | class="close" | | ||
benutzt intern List<T>, hat aber zusätzliche Mechanismen | benutzt intern List<T>, hat aber zusätzliche Mechanismen um [[ThreadSafety|Thread-safety]] zu garantieren | ||
um Thread- | |||
|} | |} | ||
