Big O Time Compleixy On Sorting Algs Flashcards by charlie LEWIS | Brainscape

Q

Worst and best case for bubble

A

Worst : o(n^2)
Best : o(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Worst and best case for merge

A

Worst case : o(log n)
Best case : o(log n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Worst and best case for insertion

A

Worst : o(n^2)
Best : o(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly