Question

c++, data structure

Write a solution to test 2 problem 3 that uses selection sort to sort the items in the vector of integers.

#include <iostream>
#include <iterator>
#include <string>
#include <random>
using namespace std;

void insertionSort(int a[], int N)
{
   int sorted = 0;
   for (int sorted = 0; sorted < N - 1; ++sorted)
   {
       int item_position = sorted + 1;
       int item = a[item_position];
       while (item_position > 0 && a[item_position - 1] > item)
       {
           a[item_position] = a[item_position - 1];
           --item_position;
           copy(a, a + N, ostream_iterator<int>(cout, " ")); cout << endl;
       }
       a[item_position] = item;
       copy(a, a + N, ostream_iterator<int>(cout, " ")); cout << endl << endl;

   }
}
int main()
{
   default_random_engine e(20190327);
   uniform_int_distribution<int> usize(16, 32);
   uniform_int_distribution<int> uelts(10, 99);
   int N = usize(e);
   N = 24;
   cout << N << endl;

   int *elts = new int[N];
   for (int i = 0; i < N; ++i)
       elts[i] = uelts(e);

   copy(elts, elts + N, ostream_iterator<int>(cout, " ")); cout << endl;
   insertionSort(elts, N);
   system("pause");
    return 0;
}

Answer 1

#include <iostream>
#include <iterator>
#include <string>
#include <random>
#include <vector>
using namespace std;

void selectionSort(vector<int> array, int arraySize){
  
for (int iterationNum = 0; iterationNum < arraySize-1; iterationNum++){
  
int minIndex = iterationNum;
  
for (int j = iterationNum+1; j < arraySize; j++){
  
if (array[j] < array[minIndex])
minIndex = j;
  
  
}
  
// swap array[minIndex] with array[iterationNum]
int temp = array[minIndex];
array[minIndex] = array[iterationNum];
array[iterationNum] = temp;

copy(array.begin(), array.end(), ostream_iterator<int>(cout, " ")); cout << endl;
cout<<endl;
  
}
  
}
int main()
{
default_random_engine e(20190327);
uniform_int_distribution<int> usize(16, 32);
uniform_int_distribution<int> uelts(10, 99);
int N = usize(e);
N = 24;
cout << N << endl;

vector<int>elts;
for (int i = 0; i < N; ++i){
elts.push_back(uelts(e));
}

copy(elts.begin(), elts.end(), ostream_iterator<int>(cout, " ")); cout << endl;
selectionSort(elts, N);
system("pause");
return 0;
}

============================================
SEE OUTPUT

34 int main() 35 36 37 38 39 40 41 42 default_random_engine e(20190327); uniform_int_distribution<int> usize(16, 32); uniform_int_distribution<int> uelts(10, 99); int N-usize(e); N -24; cout << N endl 43 kector〈int〉elts ; 44 for (int i-0; i<N; ++i)i 45 46 47 48 49 50 51selectionSort(elts, N); 52 53 54 elts.push_back(uelts(e)); copy(elts.beginQ, elts.end(), ostream_iterator<int>(cout, " ")); systemC"pause); return 0; Get URL options|compilation execution 24 95 58 22 76 61 26 66 60 29 41 46 15 29 90 20 57 90 42 66 40 67 11 1729 11 58 22 76 61 26 66 60 29 41 46 15 29 90 20 57 90 42 66 40 67 95 17 29 11 15 22 76 61 26 66 60 29 41 46 58 29 90 20 57 90 42 66 40 67 95 17 29 11 15 17 76 61 26 66 60 29 41 46 58 29 90 20 57 90 42 66 40 67 95 22 29 11 15 17 20 61 26 66 60 29 41 46 58 29 90 76 57 90 42 66 40 67 95 22 29 11 15 17 20 22 26 66 60 29 41 46 58 29 90 76 57 90 42 66 40 67 95 61 29 11 15 17 20 22 26 66 60 29 41 46 58 29 90 76 57 90 42 66 40 6795 61 29 11 15 17 20 22 26 29 60 66 41 46 58 29 90 76 57 90 42 66 40 67 95 61 29


Thanks, PLEASE COMMENT if there is any concern.