Content deleted Content added
Add citation for unsorted array insert and delete, fix linked list delete times with citation (delete and search are considered as independent operations in the classic texts and should not be conflated). Fix sorted linked list maximum as O(1). |
small typo, character should be Big Theta |
||
Line 63:
| Unsorted [[linked list]]
| O(1)
| O(1)<ref name="listdelete">{{cite book |title=Introduction to Algorithms |publisher=The College of Information Sciences and Technology at Penn State|isbn=9780262530910|authors=Cormen, Leiserson, Rivest|quote=LIST-DELETE runs in O(1) time, but if we wish to delete an element with a given key,
| N/A
| O(''n'')
| |||