Bubble sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements if they are in the wrong order until the list is fully sorted. It is best for sorting small lists or lists that are nearly sorted already. Though simple, it is not efficient for large data sets as its runtime is quadratic. The example demonstrates bubble sort by visually swapping numbers in the wrong order until the list is sorted.

1. Bubble Sort
By: Yoo Lee & Gabrielle Ortiz
Block 2A

2. Basic Introduction:
Bubble Sort is a simple yet effective sorting algorithm.
Data is placed adjacent to each other.
The sort starts from one end (the beginning), compares
2 adjacent data, and swaps them if they are in the
wrong order.
It moves on down the list and continues doing so.
When it reaches the end of the data, it starts over until
all the data is in the right order.
*As easy as the Bubble Sort is, it is sometimes
ineffective if there is a lot of data.

3. When to Use Bubble Sort
Not much use in the real world, but is a great learning tool
because it’s easy to understand and fast to implement.
Use when a fast algorithm is needed to sort:
1.) an extremely small set of data (Ex. Trying to get the books on
a library shelf back in order.)
or
2.) a nearly sorted set of data. (Ex. Trying to decide which
laptop to buy, because it is easier to compare pairs of laptops
one at a time and decide which you prefer, than to look at them
all at once and decide which was best.)

4. When to Not Use Bubble Sort
When dealing with a large set of data.
When you are looking for a quick algorithm.
Compared to other sorting algorithm, bubble sort is
really slow.

5. EXAMPLE
LET’S MIX IT UP!!

6. EXAMPLE

7. EXAMPLE

8. EXAMPLE
Now this box will go through the list, swapping
numbers if the one previous is greater than the
one after, until the numbers are in order.

9. EXAMPLE

10. EXAMPLE
WRONG ORDER!
SWITCH!

11. EXAMPLE
That’s better.

12. EXAMPLE
Moving on.

13. EXAMPLE
WRONG ORDER!
SWITCH!

14. EXAMPLE
WRONG ORDER!
SWITCH!

15. EXAMPLE

16. EXAMPLE
Moving on.

17. EXAMPLE

18. EXAMPLE

19. EXAMPLE
WRONG ORDER!
SWITCH!

20. EXAMPLE
WRONG ORDER!
SWITCH!

21. EXAMPLE

22. EXAMPLE
Moving on.

23. EXAMPLE

24. EXAMPLE
WRONG ORDER!
SWITCH!

25. EXAMPLE

26. EXAMPLE
Moving on.

27. EXAMPLE

28. EXAMPLE
WRONG ORDER!
SWITCH!

29. EXAMPLE

30. EXAMPLE

31. EXAMPLE
Moving on.

32. EXAMPLE

33. EXAMPLE
Now the box has reached the end of the line
of numbers.
It will go back to the beginning and restart
the process

34. EXAMPLE

35. EXAMPLE
WRONG ORDER!
SWITCH!

36. EXAMPLE

37. EXAMPLE

38. EXAMPLE
Moving on.

39. EXAMPLE

40. EXAMPLE
WRONG ORDER!
SWITCH!

41. EXAMPLE

42. EXAMPLE
Moving on.

43. EXAMPLE

44. EXAMPLE
WRONG ORDER!
SWITCH!

45. EXAMPLE

46. EXAMPLE
Moving on.

47. EXAMPLE

48. EXAMPLE
WRONG ORDER!
SWITCH!

49. EXAMPLE

50. EXAMPLE
Moving on.

51. EXAMPLE

52. EXAMPLE
HEY it’s already in the right
order! No need to change.

53. EXAMPLE

54. EXAMPLE
HEY it’s already in the right
order! No need to change.

55. EXAMPLE

56. EXAMPLE
WRONG ORDER!
SWITCH!

57. EXAMPLE

58. EXAMPLE
Moving on.

59. EXAMPLE

60. EXAMPLE
HEY it’s already in the right
order! No need to change.

61. EXAMPLE

62. EXAMPLE
HEY it’s already in the right
order! No need to change.

63. EXAMPLE

64. EXAMPLE
HEY it’s already in the right
order! No need to change.

65. EXAMPLE

66. EXAMPLE
WRONG ORDER!
SWITCH!

67. EXAMPLE

68. EXAMPLE
Moving on.

69. EXAMPLE

70. EXAMPLE
HEY it’s already in the right
order! No need to change.

71. EXAMPLE

72. EXAMPLE
HEY it’s already in the right
order! No need to change.

73. EXAMPLE

74. EXAMPLE
HEY it’s already in the right
order! No need to change.

75. EXAMPLE

76. EXAMPLE
HEY it’s already in the right
order! No need to change.

77. EXAMPLE
YAY WE’RE DONE!

78. Links Used
http://stackoverflow.com/questions/276113/what-is-a-bubble-sort-good-
for
http://www.stoimen.com/blog/2012/02/20/computer-algorithms-
bubble-sort/
http://vimeo.com/4315697
http://www.algolist.net/Algorithms/Sorting/Bubble_sort