Unit 3 Test Flashcards

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

A

n log n

17
Q

heap sort average case

A

n log n

18
Q

heap sort worst case

A

n log n

19
Q

mergesort best case

A

n log n

20
Q

mergesort average case

A

n log n

21
Q

mergesort worst case

A

n log n

22
Q

quicksort best case

A

n log n

23
Q

quicksort average case

A

n log n

24
Q

quicksort worst case

A

n^2

25
Q

radix sort best case

A

Kn

26
Q

radix sort average case

A

Kn

27
Q

radix sort worst case

A

Kn

28
Q

Bubble sort application

A

sorting quickly

29
Q

Selection sort application

A

sorting quickly

30
Q

shell sort application

A

more efficient insertion sort

31
Q

mergesort application

A

sorting on disk and in massive files

32
Q

what is a trie

A

data structure used for location specific keys within a set

33
Q

When is insertion sort best case

A

when the inner loop never executes