Question

Assuming you have the following ordered-array class definition:

class ordered_array {
  public:
    ordered_array(int c) {
      data = new int[c];
      cp = c;
      sz = 0;
    }

    ...

  private:
    int sz, cp; // Current size, total capacity
    int* data = nullptr;
};

Suppose that ordered_arrays can contain duplicates. Implement a method remove_duplicates(e)which takes an element e and removes it and any duplicates of it. (Note that e is the actual value to be removed, not its index in the array.) If e does not exist in the array then the array should be left unchanged. (Hint: this is just the normal remove except that all copies of the element are removed.)

void ordered_array::remove_duplicates(int e) {

Answer 1

Given below is the code for the question. Please do rate the answer if it helped. Thank you.

void ordered_array::remove_duplicates(int e) {
   int firstIdx = -1, lastIdx = -1;
   int numOccurences = 0;
  
   for(int i = 0; i < sz; i++){
       if(data[i] == e){
           firstIdx = i;
           numOccurences = 1;
           break;
       }
   }
  
   if(firstIdx != -1){
       //find the index of non-matching element which should overwrite existing spaces
       int index;
       for(index = firstIdx + 1; index < sz; index++)
       {
           if(data[index] != e)
               break;
           numOccurences++;
       }
      
       //shift the elements to cover the deleted elements
       for(int i = firstIdx, j = index; j < sz; i++, j++){
           data[i] = data[j];
       }
      
       //update size
       sz -= numOccurences;
   }
}