Lecture 342:- Let's Code Selection Sort

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

cppCopy code

#include <iostream> #include <vector> using namespace std; void selectionSort(vector<int>& arr) {    int n = arr.size();    for (int i = 0; i < n - 1; i++) {        int minIndex = i;        // Find the minimum element in the remaining unsorted part of the array        for (int j = i + 1; j < n; j++) {            if (arr[j] < arr[minIndex]) {                minIndex = j;            }        }        // Swap the minimum element with the first element of the unsorted part        swap(arr[i], arr[minIndex]);    } } // 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);    selectionSort(arr);    cout << "Sorted Array: ";    display(arr);    return 0; }

In this program, the selectionSort function takes a vector of integers as input and sorts it using the Selection Sort algorithm. The outer loop runs for n-1 passes, and the inner loop finds the minimum element in the unsorted part 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 Selection Sort algorithm.