Program Plan: Include the appropriate headers into program. Declare the appropriate functions. Define the “main()” function, Declare and define the variable “array[]” in type of integer. Call the “printArray()” function to print the array values before sorting. Call the “selectionSort()” function to sort the array values. Print the resultant array values. Define the “selectionSort()” with two arguments. One is to get array values and another one is size of the array. Declare the variables “i”, “j”, and “t” in type of integer. Using “for” loops, check the array values. Swap the array values in appropriate position. Define the “printArray()” with two arguments. One is to get array values and another one is size of the array. Print the array values using “for” loop.

Question

Want to see the full answer?

Answer 1

Question

Chapter 7, Problem 6PP

Program Plan Intro

Program Plan:

Include the appropriate headers into program.

Declare the appropriate functions.

Define the “main()” function,

Declare and define the variable “array[]” in type of integer.

Call the “printArray()” function to print the array values before sorting.

Call the “selectionSort()” function to sort the array values.

Print the resultant array values.

Define the “selectionSort()” with two arguments. One is to get array values and another one is size of the array.

Declare the variables “i”, “j”, and “t” in type of integer.

Using “for” loops, check the array values.

Swap the array values in appropriate position.

Define the “printArray()” with two arguments. One is to get array values and another one is size of the array.

Print the array values using “for” loop.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Create a MIPS program that gets a set of numbers from the user, sorts them using selection sort, and displays the sorted numbers on the screen. You should create a subprogram to do the selection sort, sending it the length and address of the array. Pseudocode for selection sort: for (int i = 0; i < aLength-1; i++) { /* find the min element in the unsorted a[i .. aLength-1] */ /* assume the min is the first element */ int jMin = i; /* test against elements after i to find the smallest */ for (int j = i+1; j < aLength; j++) { /* if this element is less, then it is the new minimum */ if (a[j] < a[jMin]) { /* found new minimum; remember its index */ jMin = j; } } if (jMin != i) { swap(a[i], a[jMin]); }}

IN C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE PLEASE SO I CAN UNDERSTAND EVERY STEP , The selection sort is one of several techniques for sorting an array. A selection sort compares every element of an array with all the other elements of the array and exchanges their values if they are out of order. After the first pass of a selection sort, the first array element is in the correct position; after the second pass the first two elements of the array are in the correct position, and so on. Thus, after each pass of a selection sort, the unsorted portion of the array contains one less element. Write and test a function that implements this sorting method.

Write the state of the elements of each of the following arrays after each pass of the outermost loop of the selection sort algorithm has occurred (after each element is selected and moved into place).int[] numbers1 = {63, 9, 45, 72, 27, 18, 54, 36};int[] numbers2 = {37, 29, 19, 48, 23, 55, 74, 12};