Bubble sort a best presentation topic
Download as PPT, PDF3 likes3,223 views
The document describes the bubble sort algorithm. Bubble sort works by repeatedly swapping adjacent elements that are in the wrong order until the array is fully sorted. It does this by making multiple passes through the array, comparing adjacent elements on each pass and swapping them if they are in the wrong order. The document provides an example of applying bubble sort to an array by making multiple passes and swapping elements until the array is sorted. It also includes sample C++ code to implement bubble sort.
![Program
void main()
{
int arr[5],i,j,tem;
cout<<“Enter Five Values”;
for(i=0,i<5,i++)
cin>>arr[i];
cout<<“The origanal values in array:n”;
for(i=0;i<5;i++)
cout<<arr[i]<<“ “;](https://image.slidesharecdn.com/bubblesortabestpresentation-150411082431-conversion-gate01/85/Bubble-sort-a-best-presentation-topic-81-320.jpg)
![for(i=0;i<5;i++)
for(j=0;j<4;j++)
If(arr[ j ]>arr[ j+1 ]
{
tem=arr[ j ];
arr[ j ]=arr[ j+1 ];
arr[ j+1]=tem;
}
cout<<“n The sorted array: n”;
for(i=0;i<5;i++)
cout<<arr[ i ]<<“ “;
getch();
}](https://image.slidesharecdn.com/bubblesortabestpresentation-150411082431-conversion-gate01/85/Bubble-sort-a-best-presentation-topic-82-320.jpg)
Bubble sort a best presentation topic
- 1. • A Presentation topic for c++ topic • A Good style and appreciated
- 2. Sorting Sorting takes an unordered collection and makes it an ordered one. 512354277 101 1 2 3 4 5 6 5 12 35 42 77 101 1 2 3 4 5 6
- 3. Introduction: Bubble Sort Also called Exchange sort. It repeatedly visits the array and compares two items at a time. It swaps these two items if they are in the wrong order. It continues to visit the array until no swaps are needed that means the array is sorted.
- 8. 674523 14 6 3398 42 The First “Bubble Up”
- 9. 674523 14 6 3398 42 The First “Bubble Up”
- 10. 674523 14 6 3398 42 Swap The First “Bubble Up”
- 11. 674598 14 6 3323 42 Swap The First “Bubble Up”
- 12. 674598 14 6 3323 42 The First “Bubble Up”
- 13. 674598 14 6 3323 42 Swap The First “Bubble Up”
- 14. 679845 14 6 3323 42 Swap The First “Bubble Up”
- 15. 679845 14 6 3323 42 The First “Bubble Up”
- 16. 679845 14 6 3323 42 Swap The First “Bubble Up”
- 17. 671445 98 6 3323 42 Swap The First “Bubble Up”
- 18. 671445 98 6 3323 42 The First “Bubble Up”
- 19. 671445 98 6 3323 42 Swap The First “Bubble Up”
- 20. 671445 6 98 3323 42 Swap The First “Bubble Up”
- 21. 671445 6 98 3323 42 The First “Bubble Up”
- 22. 671445 6 98 3323 42 Swap The First “Bubble Up”
- 23. 981445 6 67 3323 42 Swap The First “Bubble Up”
- 24. 981445 6 67 3323 42 The First “Bubble Up”
- 25. 981445 6 67 3323 42 Swap The First “Bubble Up”
- 26. 331445 6 67 9823 42 Swap The First “Bubble Up”
- 27. 331445 6 67 9823 42 The First “Bubble Up”
- 28. 331445 6 67 9823 42 Swap The First “Bubble Up”
- 29. 331445 6 67 4223 98 Swap The First “Bubble Up”
- 30. 331445 6 67 4223 98 Finished first “Bubble Up” The First “Bubble Up”
- 31. The Second “Bubble Up” 331445 6 67 4223 98
- 32. The Second “Bubble Up” 331445 6 67 4223 98 No Swap
- 33. The Second “Bubble Up” 331445 6 67 4223 98
- 34. The Second “Bubble Up” 331445 6 67 4223 98 Swap
- 35. The Second “Bubble Up” 334514 6 67 4223 98 Swap
- 36. The Second “Bubble Up” 334514 6 67 4223 98
- 37. The Second “Bubble Up” 334514 6 67 4223 98 Swap
- 38. The Second “Bubble Up” 33614 45 67 4223 98 Swap
- 39. The Second “Bubble Up” 33614 45 67 4223 98
- 40. The Second “Bubble Up” 33614 45 67 4223 98 No Swap
- 41. The Second “Bubble Up” 33614 45 67 4223 98
- 42. The Second “Bubble Up” 33614 45 67 4223 98 Swap
- 43. The Second “Bubble Up” 67614 45 33 4223 98 Swap
- 44. The Second “Bubble Up” 67614 45 33 4223 98
- 45. The Second “Bubble Up” 67614 45 33 4223 98 Swap
- 46. The Second “Bubble Up” 42614 45 33 6723 98 Swap
- 47. 42614 45 33 6723 98 Finished second “Bubble Up” The Second “Bubble Up”
- 48. The Third “Bubble Up” 42614 45 33 6723 98
- 49. The Third “Bubble Up” 42614 45 33 6723 98 Swap
- 50. The Third “Bubble Up” 42623 45 33 6714 98 Swap
- 51. The Third “Bubble Up” 42623 45 33 6714 98
- 52. The Third “Bubble Up” 42623 45 33 6714 98 Swap
- 53. The Third “Bubble Up” 42236 45 33 6714 98 Swap
- 54. The Third “Bubble Up” 42236 45 33 6714 98
- 55. The Third “Bubble Up” 42236 45 33 6714 98 No Swap
- 56. The Third “Bubble Up” 42236 45 33 6714 98
- 57. The Third “Bubble Up” 42236 45 33 6714 98 Swap
- 58. The Third “Bubble Up” 42236 33 45 6714 98 Swap
- 59. The Third “Bubble Up” 42236 33 45 6714 98
- 60. The Third “Bubble Up” 42236 33 45 6714 98 Swap
- 61. The Third “Bubble Up” 45236 33 42 6714 98 Swap
- 62. After Third Pass of Outer Loop 45236 33 42 6714 98 Finished third “Bubble Up”
- 63. The Fourth “Bubble Up” 45236 33 42 6714 98
- 64. The Fourth “Bubble Up” 45236 33 42 6714 98 Swap
- 65. The Fourth “Bubble Up” 452314 33 42 676 98 Swap
- 66. The Fourth “Bubble Up” 452314 33 42 676 98
- 67. The Fourth “Bubble Up” 452314 33 42 676 98 No Swap
- 68. The Fourth “Bubble Up” 452314 33 42 676 98
- 69. The Fourth “Bubble Up” 452314 33 42 676 98 No Swap
- 70. The Fourth “Bubble Up” 452314 33 42 676 98
- 71. The Fourth “Bubble Up” 452314 33 42 676 98 No Swap
- 72. 452314 33 42 676 98 Finished fourth “Bubble Up” After Fourth Pass of Outer Loop
- 73. The Fifth “Bubble Up” 452314 33 42 676 98
- 74. The Fifth “Bubble Up” 452314 33 42 676 98 No Swap
- 75. The Fifth “Bubble Up” 452314 33 42 676 98
- 76. The Fifth “Bubble Up” 452314 33 42 676 98 No Swap
- 77. The Fifth “Bubble Up” 452314 33 42 676 98
- 78. The Fifth “Bubble Up” 452314 33 42 676 98 No Swap
- 79. After Fifth Pass of Outer Loop 452314 33 42 676 98 Finished fifth “Bubble Up”
- 80. 452314 33 42 676 98 We did not do any swapping, so all of the other elements must be correctly placed. We can “skip” the last two passes of the outer loop.
- 81. Program void main() { int arr[5],i,j,tem; cout<<“Enter Five Values”; for(i=0,i<5,i++) cin>>arr[i]; cout<<“The origanal values in array:n”; for(i=0;i<5;i++) cout<<arr[i]<<“ “;
- 82. for(i=0;i<5;i++) for(j=0;j<4;j++) If(arr[ j ]>arr[ j+1 ] { tem=arr[ j ]; arr[ j ]=arr[ j+1 ]; arr[ j+1]=tem; } cout<<“n The sorted array: n”; for(i=0;i<5;i++) cout<<arr[ i ]<<“ “; getch(); }