Practice.cpp

#include "Practice.h"
#include <string>

using std::string;

// Receive three integers and rearrange their values so that they are in
// descending order from greatest (first) to least (third)
void Practice::sortDescending(int & first, int & second, int & third)
{
  int biggest, middle, smallest;
  if( second > third && second > first )
  {
    biggest = second;
  }
  else if( third > second && third > first )
  {
    biggest = third;
  }
  else
  {
    biggest = first;
  }
  if( second < third && second < first )
  {
    smallest = second;
  }
  else if( third < second && third < first )
  {
    smallest = third;
  }
  else
  {
    smallest = first;
  }
  if( first != biggest && first != smallest ){
    middle = first;
  }
  else if( second != biggest && second != smallest ){
    middle = second;
  }
  else{
    middle = third;
  }
}

// Receive a string and return whether or not it is strictly a palindrome,
// where it is spelled the same backwards and forwards when considering every
// character in the string, but disregarding case ('x' is the same as 'X')
bool Practice::isPalindrome(string input)
{
  for(unsigned int i=0; i < input.size(); i++)
  {
    if( input[i] < 'A' || input[i] > 'Z' )
    {
      //change lower case to upper case
      input[i] = input[i] - ('a' - 'A');
    }
  }

  bool match = false;

  for(unsigned int i=0; i < input.size()/2; i++)
  {
    if( input[i] == input[input.size()-1-i] )
      match = true;
    else
      match = false;
  }
  return match;
}

// This function receives a string and counts how many times the same character
// is repeated at the beginning of the string, before any other characters. The
// function is case sensative so 'Z' is different than 'z'.
int Practice::count_starting_repeats(string word)
{
    int repetition = 0;
    int index = 0;
    char letter;

    if( word.length() > 0 )
      letter = word[0];

    for(unsigned int i=1; i < word.length(); i++){
      if( word[i] == letter ){
        repetition++;
      }
    }

    return repetition;
}

// Receives an array that represents the hours someone sleeps each night of the week
// (as an array of seven integers) and returns a pointer to locate the first instance
// of an "all nighter" in the array (a day with 0 hours sleep) and returns the pointer.
// However, if there are no such days found, the function should return nullptr.
int* Practice::allnighter(int sleep[7])
{
  int *ptr = &sleep[0];
  for(int i = 0; i < sizeof(&sleep); i++) {
     if(*ptr == 0){
       return ptr;
     }
     ptr++;
  }
  return nullptr;
}