Sorting an array of integers Program Plan: Include requires header file. Declare the function for fill array, sort, swap values and index of smallest. Define main function. Create prompt statement. Declare variables for sample array and number used. Call the function “fillArray”. Prompt statement for index of minimum number. Call the function “indexOfSmallest”. Call the function “sort”. Prompt statement for sorted numbers. Display the sorted number using “for” loop. Define “fillArray” function. This is function is used to read the numbers from user. Define “sort” function. This function is used to sort the number by recursively call the function “sort”. In this function, first declare the variable for index of next smallest. If the start index is less than “numberUsed – 1”, then Compute the index of next smallest number by calling the function “indexOfSmallest” with arguments of array, start index, and number of values in array. Call the function “swapValues” with argument array of start index and array of next element index. Increment the start index. Then recursively call the function “sort” with argument array “a”, starting index and number of values in a given array “a”. Define “swapValues” function. This function is used to swap the two numbers. Define “indexOfSmallest” function. This function is used to compute the index of smallest number by calling the function “indexOfSmallest” recursively. In this function, first assign the minimum to array of starting index. Then if the starting index is equal to “numberUsed – 1”, then returns the starting index value. Otherwise, recursively call the function “indexOfSmallest” with three arguments such as array “a”, increment of start index by “1” and “numberUsed” and this function is assigned to a variable “indexOfMin”. If the value of “min” is greater than “a[indexOfMin]”, then return the minimum index. Otherwise, return the starting index.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 4PP

Program Plan Intro

Sorting an array of integers

Program Plan:

Include requires header file.

Declare the function for fill array, sort, swap values and index of smallest.

Define main function.

Create prompt statement.

Declare variables for sample array and number used.

Call the function “fillArray”.

Prompt statement for index of minimum number.

Call the function “indexOfSmallest”.

Call the function “sort”.

Prompt statement for sorted numbers.

Display the sorted number using “for” loop.

Define “fillArray” function.

This is function is used to read the numbers from user.

Define “sort” function.

This function is used to sort the number by recursively call the function “sort”.

In this function, first declare the variable for index of next smallest.

If the start index is less than “numberUsed – 1”, then

Compute the index of next smallest number by calling the function “indexOfSmallest” with arguments of array, start index, and number of values in array.

Call the function “swapValues” with argument array of start index and array of next element index.

Increment the start index.

Then recursively call the function “sort” with argument array “a”, starting index and number of values in a given array “a”.

Define “swapValues” function.

This function is used to swap the two numbers.

Define “indexOfSmallest” function.

This function is used to compute the index of smallest number by calling the function “indexOfSmallest” recursively.

In this function, first assign the minimum to array of starting index.

Then if the starting index is equal to “numberUsed – 1”, then returns the starting index value.

Otherwise, recursively call the function “indexOfSmallest” with three arguments such as array “a”, increment of start index by “1” and “numberUsed” and this function is assigned to a variable “indexOfMin”.

If the value of “min” is greater than “a[indexOfMin]”, then return the minimum index. Otherwise, return the starting index.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the

whats for dinner? please