223 Final Flashcards

1
Q

Vector insertion speed

A

o(1)

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

Vector remove speed

A

o(n)

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

Vector find speed

A

o(n)

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

vector sort speed

A

O(nlogn)

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

linked list sort speed

A

O(nlogn)

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

linked list find speed

A

O(n)

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

linked list remove speed

A

O(n)

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

linked list insert speed

A

O(1)

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

Binary search Insert

A

O(n)

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

Binary search remove

A

O(n)

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

Binary search find

A

logn

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

binary search sort

A

O(1)

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

Hash table insert

A

O(1)

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

Hash table remove

A

O(1)

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

Hash table find

A

O(1)

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

Hash table sort

A

O(nlogn)

17
Q

balanced binary sort insert

A

O(logn) if balanced

18
Q

BST remove

A

O nlogn if balanced