This is an individual assignment. You must complete this lab on your own, although you may discuss lab concepts with other students. Please keep the Academic Integrity Policy in mind---do not show your code to anyone outside of the professors and ninjas, and do not look at anyone else's code for this lab. If you need help, please post a question on Piazza, or contact the professor.

The goal of this lab is to further practice specific concepts in object oriented programming:

• writing methods
• operator overloading

In addition to introducing default value for function parameter.

First, download the .zip file that contains the starter code for the fifth programming assignment. It contains the code we worked on last week with our running example of the SafeIntArray. Your assignment will be to write a few more methods and overload a few more operators.

The starter code already contains the name of all the new methods you should write. I invite you to read the comments that precede the declaration of each method in safeIntArray.h to learn about the input and output behavior or each method. You should implement the following methods:

• to_string: takes no input and returns a string that represents the content of the safe array. Each element of the array should be separated by a comma (and nothing else) and the whole string should start and end with a curly brace. For example, if the array contains the numbers 1, 7, 2, and 9 the output of the method should be
  "{1,7,2,9}".
• slice: takes three integers as input, a start index, an end index and inc, the increment. This should act the same way as the slice operator in Python (remember when you did something like myList[0:n:3] in Python?). The method should return a new SafeIntArray that contains the elements of the SafeIntArray from which the method was called starting at index start (inclusive), ending at index end (exclusive) with an increment of inc. For example, if a SafeIntArray contains integers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, the taking a slice with inputs 2, 13, 3 should return a SafeIntArray that contains integers 2, 5, 8, 11. The method should throw an exception if the start or end indices are out of bounds, or if the increment is non-positive.
  The third parameter of the method should have a default value of 1, so that even if it is not included when the method is called, the value of 1 will be assumed. You do not have to write anything to make this happen, look at the way the method is declared in SafeIntArray.h, the default value is already given in the method declaration.
• operator*: takes an integer rep as a parameter, and is the same as multiplication for lists in Python. This is called the repetition operator. The method should return a new SafeIntArray that is rep times larger than the original, and whose elements consists of rep consecutive copies of the SafeIntArray from which the method was called. For example, if a SafeIntArray containing integers 1, 2, 3 is "multiplied" by 3, the returned SafeIntArray should contain integers 1, 2, 3, 1, 2, 3, 1, 2, 3 in that order.
• operator==: takes another SafeIntArray as a parameter, and returns true if the input SafeIntArray and the SafeIntArray from which the method was called have the same size, and all the elements of the two arrays are the same, and in the same order.
• find: takes an integer as input and returns the index of the first element of the SafeIntArray whose value is equal to the parameter. If no such element exists in the array, the method returns -1.
• reverse: takes no input and returns a new SafeIntArray whose content is the same as the SafeIntArray from which the method was called, except the order of the elements has been reversed.

Make sure that you thoroughly test each method in main.cpp. When grading your assignment, I will replace your main function by my own and test every possible bizarre case

For this and future labs, I will assign minor penalties for poor commenting and coding style. Here are some style tips for this lab:

• You should pick meaningful variable names.

  // good
  int *array = new int[size];
  // bad
  int *a = new int[size];
  

• You should use correct and consistent indentation. Lines of code within a block should be indented two spaces further than lines surrounding them.*

  //good
  if(condition) {
    cout << "Test" << endl;
  }
  
    //bad
    if(condition) {
  cout << "Test" << endl;
       }
  

  *if your text editor's default indenting is four spaces instead of two, don't stress about it. Just be consistent when indenting.
  
• You should use a code block whenever possible, even if it's not necessary. This will help you avoid subtle/messy errors in the future.

  //good
  if(condition) {
    cout << "Something" << endl;
  }
  
  //legal but bad
  if(condition)
    cout << "Something" << endl;
  

• Do write comments at the top of each file, indicating your name and the purpose of the code file

  /**
   * Name: Martin Gagne
   * Project: PrgAsst6
   * File: SafeIntArray.cpp
   * Content: implementation of the methods for the class SafeIntArray declared in SafeIntArray.h
   */
  

• You don't have to write a comment for each line of code, but do write comments about meaningful chunks of code such as a loop, if/else statement, etc.

  void insertAtHead(int value) {
    // make sure that there is room in the array for the additional element
    if (this->size == this->capacity) {
      this->expandCapacity();
    }
    // shift all the current element one position to the right
    for (int i=size-1; i>=0; i--) {
      this->theArray[i+1] = this->theArray[i];
    }
    //place the new element
    this->theArray[0] = value;
  }
  

• Do write comments describing the purpose and signature of each function declaration. use @param to describe an input parameter and @return to describe what gets returned. An example lies below:

  /**
   * Performs the main quick sort algorithm to sort the provided array.
   * @param array The array to sort.
   * @param startIndex The leftmost index (inclusive) of the part of the array
   *                   to sort.
   * @param endIndex The rightmost index (inclusive) of the part of the array
   *                 to sort.
   */
  void quickSort(int* array, int startIndex, int endIndex);
  

Submit a .zip file containing the entire project folder for the programming assignment using the submission link on onCourse.