Chapter 8 Flashcards by Abdul Basit | Brainscape

Q

Is merge sort recursive algorithm

A

Yes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is recurrence relation

A

a recursively defined function

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

T(n)/n = ?

A

log n + 1

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What time takes merge sort

A

n log n

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is merge sort

A

theta n log n

How well did you know this?

1

Not at all

2

3

4

5

Perfectly