Question

write the interface of the following functions in the SortedArray.cpp, by the given functions in the SortedArray.h :

#ifndef SortedArray_H
#define SortedArray_H

//INCLUDES
#include <iostream>
using namespace std;

//----------------------------------
// SortedArray<Object>
//----------------------------------

template <typename Object>
class SortedArray
{
public:

/** insert
param: obj
Description: insert new elements into the correct position in the
sorted array, sliding elements over the position to right, as needed
   */
   void insert(const Object &obj);

   /**
   Description: remove the element in position 0, and slide over all other item
   */
   void deleteMin();

/**
   Description: remove the last element in the sorted array
   */
   void deleteMax();

private:
int theSize;
int theCapacity;
Object *objects;

};

#include "SortedArray.cpp"

#endif

Answer 1

#ifndef SortedArray_H
#define SortedArray_H

//INCLUDES
#include <iostream>
using namespace std;

//----------------------------------
// SortedArray<Object>
//----------------------------------

template <typename Object>
class SortedArray
{
public:
SortedArray()
{
objects=new object[theCapacity];
}
/*Description: insert new elements into the correct position in the
sorted array, sliding elements over the position to right, as needed*/
void insert(const Object &obj)
{
theSize++;
for (int i = thesize - 2; i > 0; i--)
{
if (objects[i] > obj)//if current element is greater than obj
objects[i + 1] = objects[i];
else //if current element is less than or equal to obj
{
objects[i] = obj;
i=0;
}
}
}

/*
Description: remove the element in position 0, and slide over all other item
*/
void deleteMin()
{
theSize--;
for(int i=0;i<theSize;i++)
objects[i]=objects[i+1];
}

/*
Description: remove the last element in the sorted array
*/
void deleteMax()
{
theSize--;
}

private:
int theSize = 0 ,theCapacity = 10000;
Object *objects;
};
#endif

COMMENT DOWN FOR ANY QUERIES AND,

LEAVE A THUMBS UP IF THIS ANSWER HELPS YOU.