Search
Create
Log in
Sign up
Log in
Sign up
Big Oh Time Complexity
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (38)
Array List - get
O(1)
Linked List - get
O(N)
Array List - find
O(N)
Linked List - find
O(N)
Array List - insert
O(N)
Linked List - insert
O(1)
Array List - remove
O(N)
Linked List - remove
O(1)
Array List - empty
O(1)
Linked List - empty
O(1)
Array List - size
O(1)
Linked List - size
O(N) or O(1)
Array List - Insert (e, i)
O(N)
Linked List - insert (e, i)
O(N)
Array List - remove (i)
O(N)
Linked List - remove (i)
O(N)
binary heap (worse) - insert
O(logN)
binary heap (worse) - remove
O(logN)
binary heap (worse) - getMin
O(1)
binary heap (worse) - getMax
O(1)
binary heap (worse) - search
O(N)
binary heap (worse) - build
O(NlogN)
binary heap (avg) - insert
O(1)
binary heap (avg) - remove
O(logN)
binary heap (avg) - getMin
O(1)
binary heap (avg) - getMax
O(1)
binary heap (avg) - search
O(N)
binary heap (avg) - build
O(N)
Bubble sort (worst)
O(N^2)
Bubble sort (Avg)
1/2O(N^2)
linked list sort (worst)
O(N^2)
linked list sort (avg)
1/2O(N^2)
BST sort (worst)
O(N^2)
BST sort (avg)
O(NlogN)
AVL sort (worst)
O(NlogN)
AVL sort (avg)
O(NlogN)
BinHeap sort (worst)
O(NlogN)
BinHeap sort (avg)
O(NlogN)
;