sorting Flashcards by Lara Popovic

Q

What is the minimum height of a (full) binary tree that has X leaf nodes?

A

⌊log X⌋

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Stirling’s approximation

A

log n! ≈ n log n − n + O(logn)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

best (fastest) sorting algorithm in practice

A

quick sort

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

A

How well did you know this?

1

Not at all

2

3

4

5

Perfectly