Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Write a class called MY_ARRAY that have the following data members: • A dynamic array of integer numbers. • Integer variable to store array size. • Integer variable to store length of the array (keep track with the added items). Add the following member functions for this class: • A parametrized constructor to dynamically allocate the string of length L. The constructor should take an integer value that represent length as parameter. • A copy constructor that takes an object of string class and create a new object with same values. • A destructor to remove dynamically allocated space. • SortInsert this function add a new item to the array and keep the array sorted. ISExist this function takes an integer value and check if it exist or not in the array. Reverse this function reverse array element and store result in a new array. RemoveMinimum this function remove the minimum number from the array. • Display recursive function that display the array content. • Sumofltems Recursive function that find the summation of all elements in the array. • Removeitem function that takes an integer number and remove it from the array if exist else display a message to the user that the number is not exist. Part 2: write a main program to test your class. Part 3: Write your class as template class to deal with any data type.

Write a class called MY_ARRAY that have the following data members: • A dynamic array of integer numbers. • Integer variable to store array size. • Integer variable to store length of the array (keep track with the added items). Add the following member functions for this class: • A parametrized constructor to dynamically allocate the string of length L. The constructor should take an integer value that represent length as parameter. • A copy constructor that takes an object of string class and create a new object with same values. • A destructor to remove dynamically allocated space. • SortInsert this function add a new item to the array and keep the array sorted. ISExist this function takes an integer value and check if it exist or not in the array. Reverse this function reverse array element and store result in a new array. RemoveMinimum this function remove the minimum number from the array. • Display recursive function that display the array content. • Sumofltems Recursive function that find the summation of all elements in the array. • Removeitem function that takes an integer number and remove it from the array if exist else display a message to the user that the number is not exist. Part 2: write a main program to test your class. Part 3: Write your class as template class to deal with any data type.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Write a class called MY_ARRAY that have the following data members: • A dynamic array of integer numbers. • Integer variable to store array size. Integer variable to store length of the array (keep track with the added items). Add the following member functions for this class: • A parametrized constructor to dynamically allocate the string of length L. The constructor should take an integer value that represent length as parameter. • A copy constructor that takes an object of string class and create a new object with same values. • A destructor to remove dynamically allocated space. • SortInsert this function add a new item to the array and keep the array sorted. • ISExist this function takes an integer value and check if it exist or not in the array. • Reverse this function reverse array element and store result in a new array. • RemoveMinimum this function remove the minimum number from the array. • Display recursive function that display the array content. • Sumofltems Recursive function that find the summation of all elements in the array. • Removeitem function that takes an integer number and remove it from the array if exist else display a message to the user that the number is not exist. Part 2: write a main program to test your class. Part 3: Write your class as template class to deal with any data type.
Transcribed Image Text:Write a class called MY_ARRAY that have the following data members: • A dynamic array of integer numbers. • Integer variable to store array size. Integer variable to store length of the array (keep track with the added items). Add the following member functions for this class: • A parametrized constructor to dynamically allocate the string of length L. The constructor should take an integer value that represent length as parameter. • A copy constructor that takes an object of string class and create a new object with same values. • A destructor to remove dynamically allocated space. • SortInsert this function add a new item to the array and keep the array sorted. • ISExist this function takes an integer value and check if it exist or not in the array. • Reverse this function reverse array element and store result in a new array. • RemoveMinimum this function remove the minimum number from the array. • Display recursive function that display the array content. • Sumofltems Recursive function that find the summation of all elements in the array. • Removeitem function that takes an integer number and remove it from the array if exist else display a message to the user that the number is not exist. Part 2: write a main program to test your class. Part 3: Write your class as template class to deal with any data type.
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS