1/15
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No study sessions yet.
Array Acess
O(1)
insert at end
O(1)
Array insert and delete n middle
O(n)
Linked List Acess
O(n)
Linked list Insert, Delete
O(1)
Stacks Operations
push, pop, deque, front/back
O(1)
BST search/Insert/Delete
O(log n)
RBT search/insert/delete
O(log n)
Heps and Priority Quenes
O(log n)
Bubble sort
O(n²)
Selection Sort
O(n²)
Insertion sort
O(n²)
best: O(n)
Merge Sort
O( n log n)
Quick Sort
O ( n log n)
Quick Sort worst case
O(n²)
Heap Sort
O(n log n)