How do I implement sorting algorithms in C++?

How do I implement sorting algorithms in C++?

You can implement sorting algorithms like Bubble Sort, Quick Sort, or Merge Sort in C++. Which one would you like to know about?

Let's start with Bubble Sort.

Sure! Bubble Sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. Here's a simple implementation:

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                std::swap(arr[j], arr[j+1]);
            }
        }
    }
}

Would you like to see how it works with an example?

Yes, please show me an example with an array.

Here's an example:

#include <iostream>

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                std::swap(arr[j], arr[j+1]);
            }
        }
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);
    bubbleSort(arr, n);
    std::cout << "Sorted array: ";
    for (int i = 0; i < n; i++)
        std::cout << arr[i] << " ";
    return 0;
}

This will sort the array in ascending order. Would you like to learn about another sorting algorithm?