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

The images I have uploaded are the part 1 to 4 and questions below are continue on the questions uploaded 5. C++ Class Template with Method Stubs #pragma once #include <iostream> #include <string> #include <stdexcept> #include <vector> template <typename T> class HashTable { private: struct Entry { std::string key; T value; bool isOccupied; bool isDeleted; Entry() : key(""), value(), isOccupied(false), isDeleted(false) {} }; Entry* table; size_t capacity; size_t size; double loadFactorThreshold; size_t customHash(const std::string& key) const { size_t hash = 5381; for (char c : key) { hash = ((hash << 5) + hash) + c; } return hash; } size_t probe(const std::string& key, bool forInsert = false) const; void resize(); public: // Constructor HashTable(size_t initialCapacity = 101); // Big…

this project is NOT for graded(marks) purposes, please help me with the introduction. give me answers for the project. i will include an image explaining everything about the project.

Java Graphics (Bonus In this lab, we'll be practicing what we learned about GUIs, and Mouse events. You will need to implement the following: A GUI with a drawing panel. We can click in this panel, and you will capture those clicks as a Point (see java.awt.Point) in a PointCollection class (you need to build this). The points need to be represented by circles. Below the drawing panel, you will need 5 buttons: O о о ○ An input button to register your mouse to the drawing panel. A show button to paint the points in your collection on the drawing panel. A button to shift all the points to the left by 50 pixels. The x position of the points is not allowed to go below zero. Another button to shift all the points to the right 50 pixels. " The x position of the points cannot go further than the You can implement this GUI in any way you choose. I suggest using the BorderLayout for a panel containing the buttons, and a GridLayout to hold the drawing panel and button panels. Regardless of how…