The document describes the bubble sort algorithm sorting an array of numbers from highest to lowest over 57 steps. It starts with the array [7, 3, 6, 5, 1, 9, 2, 4, 8] and with each pass of the algorithm, the largest remaining number bubbles to the end of the array, until the array is fully sorted from lowest to highest.

1. Algorithms in Java
Lesson 1: Bubble sort

2. 2
Algorithms in Java
Bubble sort:
7 3 6 5 1 9 2 4 8

3. 3
Algorithms in Java
Bubble sort:
[7] [3] 6 5 1 9 2 4 8

4. 4
Algorithms in Java
Bubble sort:
[3] [7] 6 5 1 9 2 4 8

5. 5
Algorithms in Java
Bubble sort:
3 [7] [6] 5 1 9 2 4 8

6. 6
Algorithms in Java
Bubble sort:
3 [6] [7] 5 1 9 2 4 8

7. 7
Algorithms in Java
Bubble sort:
3 6 [7] [5] 1 9 2 4 8

8. 8
Algorithms in Java
Bubble sort:
3 6 [5] [7] 1 9 2 4 8

9. 9
Algorithms in Java
Bubble sort:
3 6 5 [7] [1] 9 2 4 8

10. 10
Algorithms in Java
Bubble sort:
3 6 5 [1] [7] 9 2 4 8

11. 11
Algorithms in Java
Bubble sort:
3 6 5 1 [7] [9] 2 4 8

12. 12
Algorithms in Java
Bubble sort:
3 6 5 1 7 [9] [2] 4 8

13. 13
Algorithms in Java
Bubble sort:
3 6 5 1 7 [2] [9] 4 8

14. 14
Algorithms in Java
Bubble sort:
3 6 5 1 7 2 [9] [4] 8

15. 15
Algorithms in Java
Bubble sort:
3 6 5 1 7 2 [4] [9] 8

16. 16
Algorithms in Java
Bubble sort:
3 6 5 1 7 2 4 [9] [8]

17. 17
Algorithms in Java
Bubble sort:
3 6 5 1 7 2 4 [8] [9]

18. 18
Algorithms in Java
Bubble sort:
3 6 5 1 7 2 4 8 9
The last element of the array is in the correct spot. Next cycle
will not include 9.

19. 19
Algorithms in Java
Bubble sort:
[3] [6] 5 1 7 2 4 8 9

20. 20
Algorithms in Java
Bubble sort:
3 [6] [5] 1 7 2 4 8 9

21. 21
Algorithms in Java
Bubble sort:
3 [5] [6] 1 7 2 4 8 9

22. 22
Algorithms in Java
Bubble sort:
3 5 [6] [1] 7 2 4 8 9

23. 23
Algorithms in Java
Bubble sort:
3 5 [1] [6] 7 2 4 8 9

24. 24
Algorithms in Java
Bubble sort:
3 5 1 [6] [7] 2 4 8 9

25. 25
Algorithms in Java
Bubble sort:
3 5 1 6 [7] [2] 4 8 9

26. 26
Algorithms in Java
Bubble sort:
3 5 1 6 [2] [7] 4 8 9

27. 27
Algorithms in Java
Bubble sort:
3 5 1 6 2 [7] [4] 8 9

28. 28
Algorithms in Java
Bubble sort:
3 5 1 6 2 [4] [7] 8 9

29. 29
Algorithms in Java
Bubble sort:
3 5 1 6 2 4 [7] [8] 9

30. 30
Algorithms in Java
Bubble sort:
3 5 1 6 2 4 7 8 9
Now 8 and 9 are in the correct spot. Next cycle will skip both

31. 31
Algorithms in Java
Bubble sort:
[3] [5] 1 6 2 4 7 8 9

32. 32
Algorithms in Java
Bubble sort:
3 [5] [1] 6 2 4 7 8 9

33. 33
Algorithms in Java
Bubble sort:
3 [1] [5] 6 2 4 7 8 9

34. 34
Algorithms in Java
Bubble sort:
3 1 [5] [6] 2 4 7 8 9

35. 35
Algorithms in Java
Bubble sort:
3 1 5 [6] [2] 4 7 8 9

36. 36
Algorithms in Java
Bubble sort:
3 1 5 [2] [6] 4 7 8 9

37. 37
Algorithms in Java
Bubble sort:
3 1 5 2 [6] [4] 7 8 9

38. 38
Algorithms in Java
Bubble sort:
3 1 5 2 [4] [6] 7 8 9

39. 39
Algorithms in Java
Bubble sort:
3 1 5 2 4 [6] [7] 8 9

40. 40
Algorithms in Java
Bubble sort:
3 1 5 2 4 6 7 8 9
Once again the last number has been put in the correct
location: next cycles will skip 7, 8 and 9

41. 41
Algorithms in Java
Bubble sort:
[3] [1] 5 2 4 6 7 8 9

42. 42
Algorithms in Java
Bubble sort:
[1] [3] 5 2 4 6 7 8 9

43. 43
Algorithms in Java
Bubble sort:
1 [3] [5] 2 4 6 7 8 9

44. 44
Algorithms in Java
Bubble sort:
1 3 [5] [2] 4 6 7 8 9

45. 45
Algorithms in Java
Bubble sort:
1 3 [2] [5] 4 6 7 8 9

46. 46
Algorithms in Java
Bubble sort:
1 3 2 [5] [4] 6 7 8 9

47. 47
Algorithms in Java
Bubble sort:
1 3 2 [4] [5] 6 7 8 9

48. 48
Algorithms in Java
Bubble sort:
1 3 2 4 [5] [6] 7 8 9

49. 49
Algorithms in Java
Bubble sort:
1 3 2 4 5 6 7 8 9
Next cycle will skip 6, 7, 8 and 9

50. 50
Algorithms in Java
Bubble sort:
[1] [3] 2 4 5 6 7 8 9

51. 51
Algorithms in Java
Bubble sort:
1 [3] [2] 4 5 6 7 8 9

52. 52
Algorithms in Java
Bubble sort:
1 [2] [3] 4 5 6 7 8 9
At this stage the array is ordered. However as the algorithm is
not aware of this, the remaining cycles will run anyway

53. 53
Algorithms in Java
Bubble sort:
1 2 [3] [4] 5 6 7 8 9

54. 54
Algorithms in Java
Bubble sort:
1 2 3 [4] [5] 6 7 8 9

55. 55
Algorithms in Java
Bubble sort:
1 2 3 4 5 6 7 8 9

56. 56
Algorithms in Java
Bubble sort:
[1] [2] 3 4 5 6 7 8 9
And so on...

57. 57
Algorithms in Java
Bubble sort:
1) Bigger arrays take longer than smaller ones as this
algorithm runs in O(N2
), as N = number of elements of the
array
2) Extremely disordered arrays take longer than fairly ordered
ones as less swaps are necessary