#include

#include

$/*$

Program sorts an array of integers using a selection sort.

The general algorithm repeatedly finds the smallest number

in the array and places it at the front of the list.

$*/$

using namespace std;

int find$\_$small$\_$index $($int start$\_$index, int numbers $[])$;

void swap$\_$values $($int index$1,$ int index$2,$ int numbers $[])$;

int main$()$

$\{$

$//$ array of numbers

int numbers $[10]=\{7,9,21,16,65,8,32,1,17,41\}$;

int start$\_$index; $//$ current starting spot for search

int small$\_$index; $//$ index of the smallest number in the array

int index; $//$ index used for print the array values

start$\_$index $=0$;

$//$ continue finding the smallest value and placing it

$//$ at the front of the list

while $($start$\_$index $<9)$

$\{$

small$\_$index $=$ find$\_$small$\_$index $($start$\_$index, numbers$)$;

swap$\_$values $($small$\_$index, start$\_$index, numbers$)$;

start$\_$index$++$;

$\}$

cout $<<"$

The sorted array is:

$"$;

for $($index $=0$; index $<10$; index$++)$

cout $<<$ numbers $[$index$]<<""$;

cout $<<"$

$"$;

return $0$;

$\}$

int find$\_$small$\_$index $($int start$\_$index, int numbers $[])$

$\{$

int small$\_$index, $//$ smallest index to be returned

index; $//$ current index being viewed

small$\_$index $=$ start$\_$index;

for $($index $=$ start$\_$index $+1$; index $<10$; index$++)$

if $($numbers $[$index$]<$ numbers $[$small$\_$index$])$

small$\_$index $=$ index;

return small$\_$index;

$\}$

void swap$\_$values $($int index$1,$ int index$2,$ int numbers $[])$

$\{$

int swapper;

swapper $=$ numbers $[$index$1]$;

numbers $[$index$1]=$ numbers $[$index$2]$;

numbers $[$index$2]=$ swapper;

$\}$

$1.$ What value would find$\_$small$\_$index return for the following array?

$34172644128172206244$

$[0][1][2][3][4][5][6][7][8][9]$

$2.$ What is the point of the assignment small$\_$index $=$ start$\_$index; at the beginning of find$\_$small$\_$index?

$3.$ In the control for the for loop in find$\_$small$\_$index, index does not start at zero as it does in many of the loops that we have written. It starts at different places, different times that it is called. Why is this?

$4.$ In the while loop in main, start$\_$index only goes up to $8($start$\_$index $<9).$ Explain why the loop does not need to run when start$\_$index equals $9($the last index in the array$).$

$5.$ In swap$\_$values, swapper is declared as an int type. Why?

$$ The program is hard coded to only work with arrays of $10$ numbers. Add a constant called size before main that is assigned the number of elements to be sorted. Use this size constant in the rest of the program so that the sort will work for any number of values. Run your program with size equal to $12($add $2$ more numbers to the array in its declaration list$).$

$$ A simple change to the program will sort the numbers from largest to smallest. Change your program so that it does this. Do not print the sorted values in reverse order! Actually change the sort.

$6.$ Write the change that you would make to the code here.

Submit :

$1.$ The answers to the above questions

$2.$ cpp version of the code.