Question

Description: Write a complete C++ program that will do the following: 1. Declare an array of 30 elements 2. Set the array to random numbers between 0 to 100 inclusive. Don't seed the random number generator. 3. Output the array. 4. Sort the array in ascending order using the selection sort. 5. Output the sorted array. Required IO: Array by F. Last Original: 1 5 ... 2 10 + Sorted: 1 2 ... 5 10 ( +

Answer 1

#include <iostream>
#include <cstdlib>
#include <ctime>

using namespace std;

void selection_sort(int arr[], int size) {
    for (int i = 0; i < size; ++i) {
        int minIndex = i;
        for (int j = i + 1; j < size; ++j) {
            if (arr[j] < arr[minIndex]) {
                minIndex = j;
            }
        }
        int temp = arr[minIndex];
        arr[minIndex] = arr[i];
        arr[i] = temp;
    }
}

int main() {
    srand(time(NULL));
    int size = 30;
    int arr[30];

    for (int i = 0; i < size; ++i) {
        arr[i] = rand() % 101;
    }

    cout << "Array by F. Last" << endl;

    cout << "\n\nOriginal:\n";
    for (int i = 0; i < size; i++) {
        cout << arr[i] << " ";
    }
    cout << endl;

    selection_sort(arr, size);

    cout << "\n\nSorted:\n";
    for (int i = 0; i < size; i++) {
        cout << arr[i] << " ";
    }
    cout << endl;
    return 0;
}

Array by F. Last Original: 93 6 52 14 86 32 57 98 85 56 97 35 3 80 44 19 74 25 52 53 14 26 30 42 3 47 88 80 89 66 Sorted: 3 3 6 14 14 19 25 26 30 32 35 42 44 47 52 52 53 56 57 66 74 80 80 85 86 88 89 93 97 98