Question

Write a function that takes as an input parameter an integer that will represent the length of the array and a second integer that represents the range of numbers the random number should generate (in other words, if the number is 50, the random number generator should generate numbers between 0 and 49 including 49.

The function then sorts the list by traversing the list, locating the smallest number, and printing out that smallest number, then replacing that number in the array with the second parameter +1 (so in our above example, it would be 51. ) Continue to do this until every number in the original array is printed out in order.

Answer 1

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

using namespace std;

void print_sorted(int n, int max) {
   int *arr = new int[n];
   for(int i =0 ; i < n; ++i) {
      arr[i] = rand() % max;
   }
   for(int i = 0; i < n; ++i) {
      int minInd = i;
      for(int j = i; j < n; ++j) {
         if(arr[j] < arr[minInd]) {
            minInd = j;
         }
      }
      if(i != minInd) {
         int temp = arr[minInd];
         arr[minInd] = arr[i];
         arr[i] = temp;
      }
      cout << arr[i] << " ";
   }
   cout << endl;
}

int main() {
   srand(time(NULL));
   print_sorted(20, 50);
   return 0;
}

1 2 6 11 14 15 15 16 23 29 30 31 31 32 36 39 40 46 47 48 Process exited after 0. Press any key to continue - - - 1285 seconds with returnvalue 0