Question

Bubble sort for 12, 2, 3, 21, 11, 10,8

Answer 1

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.

First Pass:

(12, 2, 3, 21, 11, 10,8) -> ( 2, 12, 3, 21, 11, 10, 8)  ,algorithm compares the first two elements, and swaps since 12>2.

( 2, 12, 3, 21, 11, 10, 8) -> ( 2, 3, 12, 21, 11, 10, 8)  Swap since 12 > 3.

( 2, 3, 12, 21, 11, 10, 8) ->  ( 2, 3, 12, 21, 11, 10, 8)   Since these elements are already in order (21> 12), algorithm does not swap them.

( 2, 3, 12, 21, 11, 10, 8) -> ( 2, 3, 12, 11, 21, 10, 8) Swap since 21> 11

. ( 2, 3, 12, 11, 21, 10, 8) -> ( 2, 3, 12, 11, 10, 21, 8)  Swap since 21> 10

( 2, 3, 12, 11, 10, 21, 8)-> ( 2, 3, 12, 11, 10, 8, 21) Swap since 21> 8

Second Pass:

( 2, 3, 12, 11, 10, 8, 21) -> ( 2, 3, 12, 11, 10, 8, 21) Don't swap since 3>2

( 2, 3, 12, 11, 10, 8, 21) -> ( 2, 3, 12, 11, 10, 8, 21)   Don't swap since 12>3

( 2, 3, 12, 11, 10, 8, 21) ->  ( 2, 3, 11, 12, 10, 8, 21) Swap since 12>11

( 2, 3, 11, 12, 10, 8, 21) -> ( 2, 3, 11, 10, 12, 8, 21) Swap since 12>10

( 2, 3, 11, 10, 12, 8, 21) -> ( 2, 3, 11, 10, 8, 12, 21) Swap since 12>8

Third Pass:

( 2, 3, 11, 10, 8, 12, 21) ->( 2, 3, 11, 10, 8, 12, 21) Don't swap

(2, 3, 11, 10, 8, 12, 21) -> (2, 3, 11, 10, 8, 12, 21) Don't swap

(2, 3, 11, 10, 8, 12, 21) -> (2, 3, 10, 11, 8, 12, 21) Swap since 11>10

(2, 3, 10, 11, 8, 12, 21) -> (2, 3, 10, 8, 11, 12, 21) Swap since 11>8

Fourth Pass:

(2, 3, 10, 8, 11, 12, 21) -> (2, 3, 10, 8, 11, 12, 21)   Don't swap

(2, 3, 10, 8, 11, 12, 21) -> (2, 3, 10, 8, 11, 12, 21) Don't swap

(2, 3, 10, 8, 11, 12, 21) -> (2, 3, 8, 10, 11, 12, 21) Don't swap

(2, 3, 8, 10, 11, 12, 21) -> (2, 3, 8, 10, 11, 12, 21)   Don't swap

(2, 3, 8, 10, 11, 12, 21) -> (2, 3, 8, 10, 11, 12, 21)   Don't swap

Sorted Array will be: (2, 3, 8, 10, 11, 12, 21)