Lecture 333:- Let's Code Bubble Sort

Here's a simple C++ implementation of the Bubble Sort algorithm:

cppCopy code

#include <iostream> #include <vector> using namespace std; void bubbleSort(vector<int>& arr) {    int n = arr.size();    for (int i = 0; i < n - 1; i++) {        for (int j = 0; j < n - i - 1; j++) {            if (arr[j] > arr[j + 1]) {                swap(arr[j], arr[j + 1]);            }        }    } } // Function to display the elements of the array void display(const vector<int>& arr) {    for (int val : arr)        cout << val << " ";    cout << endl; } int main() {    vector<int> arr = {64, 34, 25, 12, 22, 11, 90};    cout << "Original Array: ";    display(arr);    bubbleSort(arr);    cout << "Sorted Array: ";    display(arr);    return 0; }

This code defines the bubbleSort function, which takes a vector of integers as input and sorts it using the Bubble Sort algorithm. The outer loop runs for n-1 passes, and the inner loop compares adjacent elements and swaps them if they are in the wrong order. After each pass, the largest element will be in its correct position at the end of the array. The display function is used to print the elements of the array before and after sorting.

When you run this code, it will display the original array and then the sorted array after applying the Bubble Sort algorithm.