Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

IN C++ and please include a sample run picture 11.11 (Geometry: find the boundin

ID: 3588067 • Letter: I

Question

IN C++ and please include a sample run picture

11.11 (Geometry: find the bounding rectangle)

const int SIZE = 2;

Rectangle2D getRectangle(const double points[][SIZE[);

IN C++ and please include a sample run picture

11.11 (Geometry: find the bounding rectangle)

* A bounding rectangle is the minimum rectangle that encloses a set of points in a two-dimensional * plane. Write a function that returns a bounding rectangle for a set of points in a two-dimensional plane, as follows:

const int SIZE = 2;

Rectangle2D getRectangle(const double points[][SIZE[);

Write a test program that prompts the user to enter five points and displays the bounding * rectangle’s center, width, and height. EXAMPLE: Enter five points: 1.0 2.5 3 4 5 6 7 8 9 10 The bounding rectangle's center (5.0, 6.25), width 8.0, height 7.5

Explanation / Answer

#include #include #include class Cpu { public: virtual int dummy( int, int ) {} private: virtual int add_( int a, int b ) { return a + b; } /* A */ virtual int sub_( int a, int b ) { return a - b; } /* B */ virtual int mul_( int a, int b ) { return a * b; } /* C */ virtual int div_( int a, int b ) { return a / b; } /* D */ virtual int mod_( int a, int b ) { return a % b; } /* E */ virtual int and_( int a, int b ) { return a & b; } /* F */ virtual int or_( int a, int b ) { return a | b; } /* G */ virtual int xor_( int a, int b ) { return a ^ b; } /* H */ }; int main( int argc, char* argv[] ) { typedef int (Cpu::*Memfun)( int, int ); union { Memfun fn; unsigned char ptr[6]; } u; Cpu cpu; u.fn = &Cpu::dummy; assert( argc == 4 ); int p1 = atoi( argv[ 1 ] ); int p2 = atoi( argv[ 3 ] ); char op = argv[2][0]; assert( op >= 'A' && op