code.cpp

// Sanjay Srikanth
// 7463078
// Do not include a main function in this file
// Only submit this file
// See code.h for the descriptions of each problem
#include "code.h"


/* Problem 1: 10 pts */
 
TeaPacket* bestPacket(TeaPacket* head){
   int value = 0;
   if (head->next == nullptr)
   {
      return head;
   }
   else
   {
      if (head->rating * head->rarity >= bestPacket(head->next)->rating * bestPacket(head->next)->rarity)
      {
         return head;
      }
      else
      {
         return bestPacket(head->next);
      }
   }
}



/* Problem 2: 10 points*/

Node* insert(Node* head, int value){
   if (head == nullptr) // if list is empty
   {
      Node* cur = new Node{value, nullptr};
      head = cur;
   }
   else if (value < head->data) // if lowest value in list is greater than input value
   {
      Node* cur = new Node{value, head};
      head = cur;
   }
   else
   {
      Node* cur = head;
      Node* prev = head;
      while (cur->data < value && cur->next != nullptr)
      {
         cur = cur->next;
      }
      if (cur->data < value) // if the last data value is still less than the inserted value
      {
         Node* insertion = new Node{value, nullptr};
         cur->next = insertion;
      }
      else
      {
         while (prev->next != cur)
         {
            prev = prev->next;
         }
         Node* insertion = new Node{value, cur};
         prev->next = insertion;
      }
   }
   return head;
}

/* Problem 3: 10 points*/

bool isBalanced(std::string s){
   int aCount = 0;
   int bCount = 0;
   for (int i=0; i<s.size(); i++)
   {
      if (s.at(i) == 'A')
      {
         aCount++;
      }
      else if (s.at(i) == 'B')
      {
         bCount++;
      }
   }
   return aCount == bCount;
}