big o Flashcards

1
Q

access (avg)-arr

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

search(avg)-arr

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

insert(avg)-arr

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

delete(avg)-arr

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

access(worst)-arr

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

search(worst)-arr

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

insert(worst)-arr

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

delete(worst)-arr

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

stack,queue,linked list access (avg)

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

stack,queue,linked list search(avg)

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

stack,queue,linked list insert (avg)

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

stack,queue,linked list delete(avg)

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

stack,queue,linked list access (worst)

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

stack,queue,linked list search(worst)

A

n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

stack,queue,linked list insert(worst)

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

stack,queue,linked list delete(worst)

17
Q

hash table (a,s,i,d) avg

18
Q

hash table (a,s,i,d) worst

19
Q

BST avg

20
Q

BST worst

21
Q

B Tree/AVL tree

22
Q

quicksort

A

best: nlogn
avg: nlogn
worst: n^2

23
Q

mergesort

24
Q

bubble sort

A

best: n
avg/worst: n^2

25
insertion sort
best: n avg/worst: n^2
26
selection sort
n^2