Question: Question: Time Analysis Worst case O() of each member function with explanation. Code: //SortedArray.cpp #ifdef SortedArray_H //initial size of empty array const int initSize =

Question:

Time Analysis Worst case O() of each member function with explanation.

Code:

//SortedArray.cpp #ifdef SortedArray_H

//initial size of empty array const int initSize = 0;

//Constructor template SortedArray::SortedArray() : sizeOfArray(initSize), capacityOfArray(initSize + SPARE_CAPACITY) { objectsInArray = new Object[capacityOfArray]; }

//Copy Constructor template SortedArray::SortedArray(const SortedArray &from) : objectsInArray(NULL) { operator=(from); }

//Destructor template SortedArray::~SortedArray() { delete[] objectsInArray; }

// Overloading assignment operator template const SortedArray& SortedArray:: operator= (const SortedArray &from) { if (this != &from) { delete[] objectsInArray; sizeOfArray = from.size(); capacityOfArray = from.capacity(); objectsInArray = new Object[capacity()]; for (int i = 0; i < sizeOfArray; ++i) { objectsInArray[i] = from.objectsInArray[i]; } } return *this; }

//accessor Operator template const Object & SortedArray::operator[](int index) const { return objectsInArray[index]; }

//check if two sorted arrays are same template bool SortedArray::equals(const SortedArray &rightHandSize) { if (size() == rightHandSize.size()) { for (int i = 0; i < sizeOfArray; ++i) { if (objectsInArray[i] != rightHandSize.objectsInArray[i]) return false; } return true; } return false; }

//check if array is empty template bool SortedArray:: empty() const { if (sizeOfArray == 0) return true; return false; }

//get the size of objects template int SortedArray::size() const { return sizeOfArray; }

//get the capacity of objects template int SortedArray::capacity() const { return capacityOfArray; }

//Reserve function template void SortedArray::reserve(int newCapacity) { if (newCapacity > sizeOfArray) { Object *old = objectsInArray; objectsInArray = new Object[newCapacity]; for (int i = 0; i < sizeOfArray; ++i) { objectsInArray[i] = old[i]; } capacityOfArray = newCapacity; delete[] old; } }

//function to elements of the array template void SortedArray:: print(ostream &out, char delimiter) const { for (int i = 0; i < sizeOfArray; ++i) { out << objectsInArray[i] << delimiter; } }

// function to clear the elements in the array template void SortedArray::clear() { for (int i = 0; i < sizeOfArray; ++i) { objectsInArray[i] = NULL; } sizeOfArray = 0; }

// function to inserts elements into the sorted arry template void SortedArray::insert(const Object &obj) { if(sizeOfArray == capacityOfArray) { reserve(2 * sizeOfArray + 1); }

if(sizeOfArray == 0) { objectsInArray[0] = obj; } else { int i; for (i= sizeOfArray - 1; (i >= 0 && objectsInArray[i] > obj); i--) objectsInArray[i + 1] = objectsInArray[i];

objectsInArray[i + 1] = obj; } sizeOfArray++; }

//functino to delete minimum value template void SortedArray::deleteMinimum() { for(int i = 0; i < sizeOfArray - 1; ++i) { objectsInArray[i] = objectsInArray[i + 1]; } sizeOfArray--; }

//function to delete maximum value template void SortedArray::deleteMaximum() { sizeOfArray--; }

//function to find minimum value template const Object & SortedArray::findMinimum() const { return objectsInArray[0]; }

//function to find maximum value template const Object & SortedArray::findMaximum() const { return objectsInArray[sizeOfArray - 1]; }

//Binary Search function template int binarySearch(Object *array, int left, int right, Object object) { if (right >= left) { int mid = left + (right - left) / 2;

if (array[mid] == object) return mid;

if (array[mid] > object) return binarySearch(array, left, mid - 1, object);

return binarySearch(array, mid + 1, right, object); } return -1; }

//Binary Search template int SortedArray::binarySearch(const Object &obj) { return binarySearch(objectsInArray, 0, sizeOfArray, obj); }

#endif

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

What is the difference between MouseListener and MouseAdapter? [3 marks] (b) Via suitable HTML, the compiled version of the following Java code is presented to the appletviewer application: import...

Q:

answer the question clearly You are building a flight-control system for which a convincing safety case must be made. Would you assign the tasks of safety requirements engineering, test case...

Q:

This question concerns lexical grammars. (a) Tree Adjoining Grammars contain two types of elementary tree. (i) What are these trees called? [1 mark] (ii) If one were building a grammar for English...

Q:

Complete class diagram (phase 5 and 6). 17 Questions. 17 To be submitted: 18 Marking Criteria. 20 Appendix A: Sample Output for a completed phase 6. 22 Objectives In this assignment you will develop...

Q:

) Explain the term overloading in the context of Java constructors and methods. [2 marks] (b) Without describing the details of either, outline the relationship between the Java methods...

Q:

(i) Write down the linear program relaxation for the vertex cover problem and solve the linear program. [6 marks] (ii) Based on the solution of the linear program in (b)(i), derive an integer...

Q:

Perez Construction Four years ago, after 11 years in banking, you opened up a management consulting firm serving the Coastal Bend area of Texas. Sofia Perez, CEO of Perez Construction, recently...

Q:

Big-O analysis (worst case time complexity) I have the question and the answer, I just need an explanation on how they got the answers. . . the question (it has 3 parts: a,b, and c) . . the answers:...

Q:

Q1. Fill in the Blanks 1. In space complexity, ______________________ space is required to store the executable version of the program. (Instruction, data). 2. In space complexity, _______________...

Q:

Suppose you want to launch a new business. Starting the business would necessitate an initial equipment purchase of $6.75 million. Additionally, you have previously received a market analysis study...

Q:

Calculate the 2014 total tax for Gordon Geist, a single taxpayer with no dependents and no itemized deductions. He has an active income of $40,000, a short-term capital gain income of $4,000 from the...

Q:

The trial balance of Farley College, a government university, as of September 1, 20X5, includes the following: .:. The following transactions took place during the year: 1. A cash donation of...

Q:

Landor or appliance corporation makes and sells electric fans. What should landor use as a minimum selling price

Q:

A company issues 1,050 shares of its common stock for $33,600 cash. Prepare journal entries to record this event under each of the following separate situations.