Sorting algorithms Flashcards by Abigail Hunter-Blanco

Q

Define bubble sort

A

compare elements with each other

like rising bubble

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

best case of bubble sort

A

O(n)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

worst case of bubble sort

A

O(n^2)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

average case of bubble sort

A

O(n^2)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Define merge sort

A

use midpoints

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

time complexity of merge sort

A

O(nlogn)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly