Unit 3 Test Flashcards

(33 cards)

1
Q

bubble sort best case

A

n*

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

bubble sort average case

A

n^2

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

bubble sort worst case

A

n^2

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

selection sort best case

A

n^2

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

selection sort average case

A

n^2

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

selection sort worst case

A

n^2

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

insertion sort best case

A

n

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

insertion sort average case

A

n^2

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

insertion sort worst case

A

n^2

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

shell sort with shells increments best case

A

n^2

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

shell sort with shells increments average case

A

n^2

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

shell sort with shells increments worst case

A

n^2

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

shell sort with hibbards increments best case

A

n^5/4

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

shell sort with hibbards increments average case

A

n^5/4

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

shell sort with hibbards increments worst case

A

n^3/2

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

heap sort best case

17
Q

heap sort average case

18
Q

heap sort worst case

19
Q

mergesort best case

20
Q

mergesort average case

21
Q

mergesort worst case

22
Q

quicksort best case

23
Q

quicksort average case

24
Q

quicksort worst case

25
radix sort best case
Kn
26
radix sort average case
Kn
27
radix sort worst case
Kn
28
Bubble sort application
sorting quickly
29
Selection sort application
sorting quickly
30
shell sort application
more efficient insertion sort
31
mergesort application
sorting on disk and in massive files
32
what is a trie
data structure used for location specific keys within a set
33
When is insertion sort best case
when the inner loop never executes