Using C++, design a class named sortedArray. In this class include three data members: capacity, size, and arr (a pointer that points to the first element of the array in the heap). In addition, design a member function named insert that adds elements to the end of the array and a function print that prints the elements of the array, which is equal to size. The elements of the array should be sorted. Create a member function called moveTowardEnd to be able to insert a new element and move the rest towards the end of the array. Likewise, create a member function called moveTowardFront to move the elements of the array towards the front after an element of the array is deleted. Create a member function named remove to delete an element of the array using “pass by value” and consequently moves the left-over elements to the front of the array to take place of the deleted element of the array. Output a message if an element not present in the array is attempted to be removed. Test your program by creating a main function to declare an array of a capacity 25 elements, inserting 10 elements, then removing 3 elements from the 10 previously inserted, and inserting 3 new elements into the array. Print the array after inserting/removing each of these elements. Finally, try to remove an element not present in the array.
Using C++, design a class named sortedArray. In this class include three data members: capacity, size, and arr (a pointer that points to the first element of the array in the heap). In addition, design a member function named insert that adds elements to the end of the array and a function print that prints the elements of the array, which is equal to size. The elements of the array should be sorted. Create a member function called moveTowardEnd to be able to insert a new element and move the rest towards the end of the array. Likewise, create a member function called moveTowardFront to move the elements of the array towards the front after an element of the array is deleted. Create a member function named remove to delete an element of the array using “pass by value” and consequently moves the left-over elements to the front of the array to take place of the deleted element of the array. Output a message if an element not present in the array is attempted to be removed. Test your program by creating a main function to declare an array of a capacity 25 elements, inserting 10 elements, then removing 3 elements from the 10 previously inserted, and inserting 3 new elements into the array. Print the array after inserting/removing each of these elements. Finally, try to remove an element not present in the array.
Required language is C++
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 4 images
