Week2-OOP-Mon

oop-week2-mon.cpp

#include <iostream>
using namespace std;

// get max element of array
int findMax(int myArr[]) {
  int max = myArr[0];
  for (int i = 0; i < 5; i++) {
    if (myArr[i] > max) {
      max = myArr[i];
    }
  }
  return max;
}

// get min element of array
int findMin(int myArr[]) {
  int min = myArr[0];
  for (int i = 0; i < 5; i++) {
    if (myArr[i] < min) {
      min = myArr[i];
    }
  }
  return min;
}

// increment
void increment(int *n) { *n += 1; }

// main
int main() {
  int myArr[5] = {1, 2, 3, 4, 5};
  int max = findMax(myArr);
  int min = findMin(myArr);
  cout << "Max => " << max << endl;
  cout << "Min => " << min << endl;

  int i = 7;
  increment(&i);
  cout << i << endl;

  int arr2[5] = {2, 4, 6, 8, 10};
  int *ptr = &arr2[0];
  for (int i = 0; i < 5; i++) {
    // cout << arr2[i] << endl;
    cout << *(ptr + i) << endl;
  }

  // Heap (can grow or shrink depend on need) use "new" keyword
  // Stack (Scope variables) or if we know the size
  // Global (Global Variable)
  //

  int size; // this will be stored in stack space
  cout << "Enter the size: ";
  cin >> size;

  int *myheapArr = new int[size]; // this will be created in "HEAP" space;
                                  // (because of "new" keyword)

  myheapArr[0] = 76;
  *(myheapArr + 1) = 88;

  int *nPtr = new int;
  *nPtr = 8;
  ptr = new int;
}