Inserting an element to array Program Plan: Include required header files. Declare an array with the size “100”. Declare an integer variable “top_value” to store the index of last inserted element. Define the function “insert_in_array()” with two parameters “element” and “position”. This function is used to insert an element to specified position of an array. Declare required variable. Check condition for “position”. If “position” is less than “0” or “position” is greater than “top_value”, then display an error message. Otherwise, that is if the position is in the range. Insert an element one by one in the specified position using “for” loop. Shift elements by “1” position to the right. Insert the element at the desired location. Increment the value of “top_value” by “1”. Define the function “display_array()” which is used to display the elements in the array. Declare required variables. If the “top_value” is equal to “0” that is there is no element in the array, then display an error message. Otherwise, display all elements in the array. Define main function. Declare required variables. Set “top_value” to “0”. Performs “do-while” loop. This loop will perform until the user enters the choice “3”. Display menu options to user. Read choice from user. Check user entered option using “switch” statement. If the user entered option is “1”, then Read the position for element from user. Read an element for given position from user. Call the function “insert_in_array()” with argument “insert_element” and “idx”. If user entered option is “2”, then display the array elements by calling the function “display_array()”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 3, Problem 2PE

Program Plan Intro

Inserting an element to array

Program Plan:

Include required header files.

Declare an array with the size “100”.

Declare an integer variable “top_value” to store the index of last inserted element.

Define the function “insert_in_array()” with two parameters “element” and “position”. This function is used to insert an element to specified position of an array.

Declare required variable.

Check condition for “position”. If “position” is less than “0” or “position” is greater than “top_value”, then display an error message.

Otherwise, that is if the position is in the range.

Insert an element one by one in the specified position using “for” loop.

Shift elements by “1” position to the right.

Insert the element at the desired location.

Increment the value of “top_value” by “1”.

Define the function “display_array()” which is used to display the elements in the array.

Declare required variables.

If the “top_value” is equal to “0” that is there is no element in the array, then display an error message.

Otherwise, display all elements in the array.

Define main function.

Declare required variables.

Set “top_value” to “0”.

Performs “do-while” loop. This loop will perform until the user enters the choice “3”.

Display menu options to user.

Read choice from user.

Check user entered option using “switch” statement.

If the user entered option is “1”, then

Read the position for element from user.

Read an element for given position from user.

Call the function “insert_in_array()” with argument “insert_element” and “idx”.

If user entered option is “2”, then display the array elements by calling the function “display_array()”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

using r language

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…

using r language