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

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.

Exercise 1:In this problem, we would like to implement a variation of the Bubble Sort algorithm. The algorithm differs from a bubble sort in that it sorts in both directions on each pass through the list. The algorithm is illustrated as in the following figure: For the first step, we perform bubble sort from the index 1 to n (n is thenumber of elements in the array). The next step, we perform a reserved bubble sort from the index n to 1. The process is repeated until all the array is sorted. Propose a pseudo-code to complete the Bubble Sort algorithm. Implement and test this algorithm in C/C++. Analyze and compute the complexity of this algorithm in the best, average and worst scenarios.Exercise 2:Re-implement Exercise 1 using a linear data structure: List, Stack, Queue. Justify your choice of data structure.

The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are, a) 5 and 4 b) 4 and 5 c) 2 and 4 d) 2 and 5