Big O Notation

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/104

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 8:12 PM on 6/18/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

105 Terms

1
New cards
Quicksort average time complexity
Θ(n log(n))
2
New cards
Quicksort worst time complexity
O(n^2)
3
New cards
Quicksort worst space complexity
O(log(n))
4
New cards
Mergesort average time complexity
Θ(n log(n))
5
New cards
Mergesort worst time complexity
O(n log(n))
6
New cards
Mergesort worst space complexity
O(n)
7
New cards
Heapsort average time complexity
Θ(n log(n))
8
New cards
Heapsort worst time complexity
O(n log(n))
9
New cards
Heapsort worst space complexity
O(1)
10
New cards
Bubble Sort average time complexity
Θ(n^2)
11
New cards
Bubble Sort worst time complexity
O(n^2)
12
New cards
Bubble Sort worst space complexity
O(1)
13
New cards
Insertion Sort average time complexity
Θ(n^2)
14
New cards
Insertion Sort worst time complexity
O(n^2)
15
New cards
Insertion Sort worst space complexity
O(1)
16
New cards
Selection Sort average time complexity
Θ(n^2)
17
New cards
Selection Sort worst time complexity
O(n^2)
18
New cards
Selection Sort worst space complexity
O(1)
19
New cards
Shell Sort average time complexity
Θ(n(log(n))^2)
20
New cards
Shell Sort worst time complexity
O(n(log(n))^2)
21
New cards
Shell Sort worst space complexity
O(1)
22
New cards
Bucket Sort average time complexity
Θ(n+k)
23
New cards
Bucket Sort worst time complexity
O(n^2)
24
New cards
Bucket Sort worst space complexity
O(n)
25
New cards
Radix Sort average time complexity
Θ(nk)
26
New cards
Radix Sort worst time complexity
O(nk)
27
New cards
Radix Sort worst space complexity
O(n+k)
28
New cards
Array average access
Θ(1)
29
New cards
Array average search
Θ(n)
30
New cards
Array average insertion
Θ(n)
31
New cards
Array average deletion
Θ(n)
32
New cards
Array worst access
O(1)
33
New cards
Array worst search
O(n)
34
New cards
Array worst insertion
O(n)
35
New cards
Array worst deletion
O(n)
36
New cards
Stack average access
Θ(n)
37
New cards
Stack average search
Θ(n)
38
New cards
Stack average insertion
Θ(1)
39
New cards
Stack average deletion
Θ(1)
40
New cards
Stack worst access
O(n)
41
New cards
Stack worst search
O(n)
42
New cards
Stack worst insertion
O(1)
43
New cards
Stack worst deletion
O(1)
44
New cards
Queue average access
Θ(n)
45
New cards
Queue average search
Θ(n)
46
New cards
Queue average insertion
Θ(1)
47
New cards
Queue average deletion
Θ(1)
48
New cards
Queue worst access
O(n)
49
New cards
Queue worst search
O(n)
50
New cards
Queue worst insertion
O(1)
51
New cards
Queue worst deletion
O(1)
52
New cards
Singly-Linked List average access
Θ(n)
53
New cards
Singly-Linked List average search
Θ(n)
54
New cards
Singly-Linked List average insertion
Θ(1)
55
New cards
Singly-Linked List average deletion
Θ(1)
56
New cards
Singly-Linked List worst access
O(n)
57
New cards
Singly-Linked List worst search
O(n)
58
New cards
Singly-Linked List worst insertion
O(1)
59
New cards
Singly-Linked List worst deletion
O(1)
60
New cards
Doubly-Linked List average access
Θ(n)
61
New cards
Doubly-Linked List average search
Θ(n)
62
New cards
Doubly-Linked List average insertion
Θ(1)
63
New cards
Doubly-Linked List average deletion
Θ(1)
64
New cards
Doubly-Linked List worst access
O(n)
65
New cards
Doubly-Linked List worst search
O(n)
66
New cards
Doubly-Linked List worst insertion
O(1)
67
New cards
Doubly-Linked List worst deletion
O(1)
68
New cards
Hash Table average search
Θ(1)
69
New cards
Hash Table average insertion
Θ(1)
70
New cards
Hash Table average deletion
Θ(1)
71
New cards
Hash Table worst search
O(n)
72
New cards
Hash Table worst insertion
O(n)
73
New cards
Hash Table worst deletion
O(n)
74
New cards
Binary Search Tree average access
Θ(log(n))
75
New cards
Binary Search Tree average search
Θ(log(n))
76
New cards
Binary Search Tree average insertion
Θ(log(n))
77
New cards
Binary Search Tree average deletion
Θ(log(n))
78
New cards
Binary Search Tree worst access
O(n)
79
New cards
Binary Search Tree worst search
O(n)
80
New cards
Binary Search Tree worst insertion
O(n)
81
New cards
Binary Search Tree worst deletion
O(n)
82
New cards
B-Tree average access
Θ(log(n))
83
New cards
B-Tree average search
Θ(log(n))
84
New cards
B-Tree average insertion
Θ(log(n))
85
New cards
B-Tree average deletion
Θ(log(n))
86
New cards
B-Tree worst access
O(log(n))
87
New cards
B-Tree worst search
O(log(n))
88
New cards
B-Tree worst insertion
O(log(n))
89
New cards
B-Tree worst deletion
O(log(n))
90
New cards
Red-Black Tree average access
Θ(log(n))
91
New cards
Red-Black Tree average search
Θ(log(n))
92
New cards
Red-Black Tree average insertion
Θ(log(n))
93
New cards
Red-Black Tree average deletion
Θ(log(n))
94
New cards
Red-Black Tree worst access
O(log(n))
95
New cards
Red-Black Tree worst search
O(log(n))
96
New cards
Red-Black Tree worst insertion
O(log(n))
97
New cards
Red-Black Tree worst deletion
O(log(n))
98
New cards
AVL Tree average access
Θ(log(n))
99
New cards
AVL Tree average search
Θ(log(n))
100
New cards
AVL Tree average insertion
Θ(log(n))