Algorithms Flashcards by Aidan Smith

Q

Bubble Sort Algorithm

A

Start from the first index and compare the the first two elements
If the first element is smaller, swap them
Repeat this comparison for the same element until you haven’t swapped it
Repeat from step 1

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Bubble Sort Time Complexity

A

O(n^2)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Bubble Sort Space Complexity

A

O(1)

How well did you know this?

1

Not at all

2

3

4

5

Perfectly