Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Question
100%
[画像:Lab 09 Understanding C++ pointers Assume p1, p2, and p3 are pointers to integer numbers. As an example, consider int n1 = 33; int n2 = 11; int n3 = 22; You are asked to implement the function void arrangelnOrder(int* p1, int* p2, int* p3) The function's goal is to order the data referenced by the pointers in such a way that after the function is called, p1 points to the smallest and p3 points to the largest of the three values. Test your function using the following main() method. Make sure your app works for all possible combinations of integer values referenced by the pointers. int main() { int n1 = 33; int n2 = 11; int n3 = 22; cout << "Before the call. n1=" << n1<< ", n2="<< n2 << ", n3=" << n3 << endl; arrangelnOrder(&n1, &n2, &n3); cout << "After the call. n1=" << n1 << ", n2=" << n2 << ", n3=" << n3 << endl; } It should produce the following output. Before the call. n1=33, n2=11, n3=22 After the call. n1=11, n2=22, n3=33 NOTE. Do not copy the data value into an array/vector and then sort them. Such a solution will be considered unacceptable. ]
expand button
Transcribed Image Text:Lab 09 Understanding C++ pointers Assume p1, p2, and p3 are pointers to integer numbers. As an example, consider int n1 = 33; int n2 = 11; int n3 = 22; You are asked to implement the function void arrangelnOrder(int* p1, int* p2, int* p3) The function's goal is to order the data referenced by the pointers in such a way that after the function is called, p1 points to the smallest and p3 points to the largest of the three values. Test your function using the following main() method. Make sure your app works for all possible combinations of integer values referenced by the pointers. int main() { int n1 = 33; int n2 = 11; int n3 = 22; cout << "Before the call. n1=" << n1<< ", n2="<< n2 << ", n3=" << n3 << endl; arrangelnOrder(&n1, &n2, &n3); cout << "After the call. n1=" << n1 << ", n2=" << n2 << ", n3=" << n3 << endl; } It should produce the following output. Before the call. n1=33, n2=11, n3=22 After the call. n1=11, n2=22, n3=33 NOTE. Do not copy the data value into an array/vector and then sort them. Such a solution will be considered unacceptable.
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
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
    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