Data structures and algorithms in C++
Data structures and algorithms in C++
2nd Edition
ISBN: 9780470460443
Author: Goodrich
Publisher: WILEY
bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 1, Problem 1C

Explanation of Solution

Pseudo code:

//define a function reverse()

Procedure reverse()

//declare required variables

INT a[20],b[20],n.

//prompt the user to enter the number of elements

PRINT Enter the no: of elements:

//get the number of elements

GET n

//iterate a FOR loop

FOR i=0 to i<n

//prompt the use to enter the elements

PRINT Enter the elements

//get the values

GET a[i]

//iterate a FOR loop

FOR i=0 to i<n

//reverse the element

b[n-1-i]=a[i]

//iterate a FOR loop

FOR i=0 to i<n

//prompt the reversed elements

PRINT b[i]

Explanation:

The above pseudo code is used to create a function that takes an array of integers and reverse its order. In the procedure,

  • Declare the procedure “reverse()”.
  • Declare the variables and arrays.
  • Print the user to enter the number of elements.
  • Get the number of elements.
  • Iterate a “for” loop up to “i<n”.
  • Print to the user to enter the elements.
  • Get the values to “a[i]”.
  • Iterate a “for” loop up to “i<n”.
  • Reverse the elements.
  • Iterate a “for” loop up to “i<n”.
  • Print the elements.

C++ function:

void reverse()

{

//declare the required variables

int a[20],b[20],n;

//prompt the user to enter the number of elements

cout<<"Enter the no: of elements:";

//scan for the value

cin>>n;

//iterate a for loop

for(int i=0;i<n;i++)

{

//prompt the user to enter the elements

cout<<"Enter the"<<i<<" element:";

//scan for the values

cin>>a[i];

}

//iterate a for loop

for(int i=0;i<n;i++)

{

//Reversing the elements

b[n-1-i]=a[i];

}

//iterate a for loop

for(int i=0;i<n;i++)

{

//Display of reversed elements

cout<<b[i]<<"\n";

}

}

Explanation:

The above program code is used to create a function that takes an array of integers and reverse its order. In the procedure,

  • Declare the function “reverse()”.
  • Declare the variables and arrays.
  • Print the user to enter the number of elements.
  • Get the number of elements.
  • Iterate a “for” loop up to “i<n”.
    • Print to the user to enter the elements.
    • Get the values to “a[i]”...

Blurred answer
Students have asked these similar questions
Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create a PowerPoint presentation that follows the format and style of slides 11 to 23 from Lecture Slide Set 06 (LS06). You should copy those slides and make any necessary changes, additions, or deletions to reflect your own topology, shortest-path calculations, and update tables. Do not alter the original slide style, layout, or formatting.
Create an original network topology consisting of at least seven routers and twelve links, assigning arbitrary positive weights to each link. Using this topology, apply Dijkstra's Link-State Algorithm to compute the shortest paths from a source router of your choice to all other routers in the network. Your topology must be entirely your own design and should not resemble any examples from the textbook, lecture slides, or other students' work. Al-generated topologies are not permitted. Create
x3003 x3008 1110 0000 0000 1100 1110 0010 0001 0000 0101 0100 1010 0000 x3004 0010 0100 0001 0011 x3005 0110 0110 0000 0000 X3006 0110 1000 0100 0000 x3007 0001 0110 1100 0100 0111 0110 0000 What does the following LC-3 program do? Trace Step by Step, SHOW ALL YOUR WORK. x3001 x3002 0000 x3009 0001 0000 0010 0001 X300A 0001 0010 0110 0001 x300B 0001 0100 1011 1111 x300C 0000 0011 1111 1000 X300D 1111 0000 0010 0101 x300E 0000 0000 0000 0101 x300F 0000 0000 0000 0100 x3010 0000 0000 0000 0011 x3011 0000 0000 0000 0110 x3012 0000 0000 0000 0010 x3013 x3014 0000 0000 0000 0000 0000 0100 0000 0111 x3015 0000 0000 0000 0110 x3016 0000 0000 0000 1000 x3017 0000 0000 0000 0111 x3018 0000 0000 0000 0101
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education
Definition of Array; Author: Neso Academy;https://www.youtube.com/watch?v=55l-aZ7_F24;License: Standard Youtube License