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

Q5-The efficiency of a 200 KVA, single phase transformer is 98% when operating at full load 0.8 lagging p.f. the iron losses in the transformer is 2000 watt. Calculate the i) Full load copper losses ii) half load copper losses and efficiency at half load. Ans: 1265.306 watt, 97.186%

2. Consider the following pseudocode for partition: function partition (A,L,R) pivotkey = A [R] t = L for i L to R-1 inclusive: if A[i] A[i] t = t + 1 end if end for A [t] A[R] return t end function Suppose we call partition (A,0,5) on A=[10,1,9,2,8,5]. Show the state of the list at the indicated instances. Initial A After i=0 ends After 1 ends After i 2 ends After i = 3 ends After i = 4 ends After final swap 10 19 285 [12 pts]

.NET Interactive Solving Sudoku using Grover's Algorithm We will now solve a simple problem using Grover's algorithm, for which we do not necessarily know the solution beforehand. Our problem is a 2x2 binary sudoku, which in our case has two simple rules: •No column may contain the same value twice •No row may contain the same value twice If we assign each square in our sudoku to a variable like so: 1 V V₁ V3 V2 we want our circuit to output a solution to this sudoku. Note that, while this approach of using Grover's algorithm to solve this problem is not practical (you can probably find the solution in your head!), the purpose of this example is to demonstrate the conversion of classical decision problems into oracles for Grover's algorithm. Turning the Problem into a Circuit We want to create an oracle that will help us solve this problem, and we will start by creating a circuit that identifies a correct solution, we simply need to create a classical function on a quantum circuit that…