From 681e15304e1f84ed15fdfd2092d6ed0b999fd7dd Mon Sep 17 00:00:00 2001
From: Ben Harris <ben@tilde.team>
Date: Sat, 15 Jan 2022 23:41:00 -0500
Subject: [PATCH] fix formatting and remove unnecessary includes

---
 PG1/PG1.cpp    | 105 +++++++++++++++++++++----------------------
 PG1/PG1.h      |  10 ++---
 PG2/PG2.cpp    | 119 ++++++++++++++++++++++++++-----------------------
 PG2/PG2.h      |  14 ++++--
 PG3/List.cpp   |  46 ++++++++++---------
 PG3/List.h     |  16 ++++---
 PG3/Node.cpp   |  43 ++++++++++--------
 PG3/Node.h     |  22 ++++-----
 PG3/PG3.cpp    |  25 +++++------
 PG3/PG3.h      |   1 +
 PG4/List.cpp   |  46 ++++++++++---------
 PG4/List.h     |  20 +++++----
 PG4/Node.cpp   |  79 +++++++++++++++++---------------
 PG4/Node.h     |  29 ++++++------
 PG4/PG4.cpp    |  58 +++++++++++++-----------
 PG4/PG4.h      |   1 +
 PG4/pg4        | Bin 24814 -> 0 bytes
 PG5/ArrayLL.h  |  76 ++++++++++++++++---------------
 PG5/ArrayLLN.h |  55 ++++++++++++-----------
 PG5/PG5.cpp    | 105 ++++++++++++++++++++++---------------------
 PG5/PG5.h      |   1 +
 PG6/PG6.cpp    |  85 +++++++++++++++++------------------
 PG6/PG6.h      |   3 ++
 23 files changed, 513 insertions(+), 446 deletions(-)
 delete mode 100644 PG4/pg4

diff --git a/PG1/PG1.cpp b/PG1/PG1.cpp
index 13115ca..adc0897 100644
--- a/PG1/PG1.cpp
+++ b/PG1/PG1.cpp
@@ -1,81 +1,80 @@
 //Ben Harris
 //This program converts decimal to dozenal.
 
-#include <iostream> //import
-#include <string>
+#include <iostream>
 #include <cstdlib>
-#include <sstream>
 #include "PG1.h"
+
 using namespace std;
 
 //main method runs at execution time
-int main (int argc, char **argv) { //signature
-	cout << "Enter a number in decimal:  ";
-	string input;
-	getline (cin,input);
-	cout << input << " in dozenal is " << dozenal (input) << endl;
-	system ("pause");
-	return 0;
+int main(int argc, char **argv) { //signature
+    cout << "Enter a number in decimal:  ";
+    string input;
+    getline(cin, input);
+    cout << input << " in dozenal is " << dozenal(input) << endl;
+    return 0;
 }
+
 //this method divides by 12 and returns the quotient, to be stored
-string div12 (string dividend, int &remainder) {
-	
-	int save = 0;
-	string quotient = "";
-	
-	for (int i = 0 ; i < dividend.length() ; i++){
+string div12(string dividend, int &remainder) {
 
-		if(save != 0){
+    int save = 0;
+    string quotient = "";
 
-			save = (save * 10) + (dividend[i]-'0');
-			int j = save/12; //divide by 12
-			char c = j+'0'; //convert to char
-			quotient = quotient+c;
-			save = save%12;
-			
-		}
-		else {
-			save = dividend[i]-'0';
-			quotient += '0';
-		}			
-	}
-	remainder = save;
-	return quotient;
+    for (int i = 0; i < dividend.length(); i++) {
+
+        if (save != 0) {
+
+            save = (save * 10) + (dividend[i] - '0');
+            int j = save / 12; //divide by 12
+            char c = j + '0'; //convert to char
+            quotient = quotient + c;
+            save = save % 12;
+
+        } else {
+            save = dividend[i] - '0';
+            quotient += '0';
+        }
+    }
+    remainder = save;
+    return quotient;
 }
+
 //this method calls the div12 method and stores each remainders as the next digit
-string dozenal (string input) {
+string dozenal(string input) {
 
-	string dozenalNumber = "";
-	int remainder = 0;
+    string dozenalNumber = "";
+    int remainder = 0;
 
-	while( atoi(div12(input,remainder).c_str()) != 0 ) {
+    while (atoi(div12(input, remainder).c_str()) != 0) {
 
-		input = div12(input,remainder);
+        input = div12(input, remainder);
 
-		char remainderChar;
+        char remainderChar;
 
-		if(remainder == 10){
-			remainderChar = 'A';
-		}else if (remainder == 11){
-			remainderChar = 'B';
-		}else remainderChar = remainder+'0';
+        if (remainder == 10) {
+            remainderChar = 'A';
+        } else if (remainder == 11) {
+            remainderChar = 'B';
+        } else remainderChar = remainder + '0';
 
-		dozenalNumber = remainderChar+dozenalNumber;
+        dozenalNumber = remainderChar + dozenalNumber;
 
-	}
+    }
 
 
-		input = div12(input,remainder);
+    input = div12(input, remainder);
 
-		char remainderChar = remainder;
+    char remainderChar = remainder;
 
-		if(remainder == 10){
-			remainderChar = 'A';
-		}else if (remainder == 11){
-			remainderChar = 'B';
-		}else remainderChar = remainder+'0';
+    if (remainder == 10) {
+        remainderChar = 'A';
+    } else if (remainder == 11) {
+        remainderChar = 'B';
+    } else remainderChar = remainder + '0';
 
-		dozenalNumber = remainderChar+dozenalNumber;
+    dozenalNumber = remainderChar + dozenalNumber;
 
-	return dozenalNumber;
+    return dozenalNumber;
 }
diff --git a/PG1/PG1.h b/PG1/PG1.h
index 9bc9020..0f99bb9 100644
--- a/PG1/PG1.h
+++ b/PG1/PG1.h
@@ -5,14 +5,14 @@
 #define _PG1_
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
-#include <sstream>
+
 using namespace std;
 
-int main (int argc, char **argv); //prototype
-string div12 (string dividend, int &remainder);
-string dozenal (string input);
+int main(int argc, char **argv); //prototype
+string div12(string dividend, int &remainder);
+
+string dozenal(string input);
 
 
 #endif
diff --git a/PG2/PG2.cpp b/PG2/PG2.cpp
index aab5a62..73ed08d 100644
--- a/PG2/PG2.cpp
+++ b/PG2/PG2.cpp
@@ -3,76 +3,83 @@
 //then checks for poker hands excluding straight, flush, and straight flush
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
 #include "time.h"
 #include "PG2.h"
+
 using namespace std;
 
-int main (int argc, char **argv){//main method
-	//initialize deck and randomize it
-	srand((unsigned)time(0));
-	int *deck = new int[52];
-	for(int i=0;i<52;i++){
-		deck[i]=i;
-	}
-	shuffle(deck);
+int main(int argc, char **argv) {
+    // initialize deck and randomize it
+    srand((unsigned) time(0));
+    int *deck = new int[52];
+    for (int i = 0; i < 52; i++) {
+        deck[i] = i;
+    }
+    shuffle(deck);
 
-	//start to deal the hands
-	for(int j = 0; j<10;j++){//deals ten hands
+    // start to deal the hands
+    for (int j = 0; j < 10; j++) {//deals ten hands
 
-		int rankcount[13] = {0};
-		for(int i = j*5;i<j*5+5;i++){//print, then check each hand for duplicates
-			rankcount[deck[i]/4]++;
-			cout << getRankName(deck[i]) << " of " << getSuitName(deck[i]) << endl;
+        int rankcount[13] = {0};
+        for (int i = j * 5; i < j * 5 + 5; i++) {//print, then check each hand for duplicates
+            rankcount[deck[i] / 4]++;
+            cout << getRankName(deck[i]) << " of " << getSuitName(deck[i]) << endl;
 
-		}
-		cout<<endl;
-		if (inArray(rankcount, 2, 13) && inArray(rankcount, 3, 13))cout << "FULL HOUSE";
-		else if (dupeinarray(rankcount, 2, 13))cout << "TWO PAIR";
-		else if (inArray(rankcount, 4, 13))cout << "FOUR OF A KIND";
-		else if (inArray(rankcount, 3, 13))cout << "THREE OF A KIND";
-		else if(inArray(rankcount,2,13))cout<<"ONE PAIR";
-		else cout<<"NOTHING";
-		cout<<endl;
-		cout<<endl;
+        }
+        cout << endl;
+        if (inArray(rankcount, 2, 13) && inArray(rankcount, 3, 13))cout << "FULL HOUSE";
+        else if (dupeinarray(rankcount, 2, 13))cout << "TWO PAIR";
+        else if (inArray(rankcount, 4, 13))cout << "FOUR OF A KIND";
+        else if (inArray(rankcount, 3, 13))cout << "THREE OF A KIND";
+        else if (inArray(rankcount, 2, 13))cout << "ONE PAIR";
+        else cout << "NOTHING";
+        cout << endl;
+        cout << endl;
 
-	}
-	//remove systempause before turning in
-	//system("pause");
-	delete[] deck;
-	return 0;
+    }
+    //remove systempause before turning in
+    //system("pause");
+    delete[] deck;
+    return 0;
 }
 
-string getSuitName(int card){//returns the suit of the input card
-	string suits[4] = {"Hearts","Clubs","Diamonds","Spades"};
-	return suits[card%4];
+string getSuitName(int card) {//returns the suit of the input card
+    string suits[4] = {"Hearts", "Clubs", "Diamonds", "Spades"};
+    return suits[card % 4];
 }
-string getRankName(int card){//returns the rank of the input card
-	string ranks[13] = {"Two","Three","Four","Five","Six","Seven","Eight","Nine","Ten","Jack","Queen","King","Ace"};
-	return ranks[card/4];
+
+string getRankName(int card) {//returns the rank of the input card
+    string ranks[13] = {"Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Jack", "Queen", "King",
+                        "Ace"};
+    return ranks[card / 4];
 }
-void swapTwo(int a, int b,int *d){//swaps two ints a and b within an array d
-	d[b] = d[a]+d[b];
-	d[a] = d[b]-d[a];
-	d[b] = d[b]-d[a];
+
+void swapTwo(int a, int b, int *d) {//swaps two ints a and b within an array d
+    d[b] = d[a] + d[b];
+    d[a] = d[b] - d[a];
+    d[b] = d[b] - d[a];
 }
-void shuffle(int *d){//swaps each element with a random index at or before the current index, shuffling the deck
-	for(int i = 1; i<52;i++){
-		int r = rand()%(i+1);
-		swapTwo(i,r,d);
-	}
+
+void shuffle(int *d) {//swaps each element with a random index at or before the current index, shuffling the deck
+    for (int i = 1; i < 52; i++) {
+        int r = rand() % (i + 1);
+        swapTwo(i, r, d);
+    }
 }
-bool inArray(int *d,int toinsert, int sz){//returns true if toinsert is found in array d; checks only up to size
-	for(int i = 0; i<sz;i++){
-		if(toinsert == d[i])return true;
-	}return false;
+
+bool inArray(int *d, int toinsert, int sz) {//returns true if toinsert is found in array d; checks only up to size
+    for (int i = 0; i < sz; i++) {
+        if (toinsert == d[i])return true;
+    }
+    return false;
 }
-bool dupeinarray(int *d, int dupetocheck, int sz){//checks for duplicate dupetocheck in array d
-	int cnt = 0;
-	for (int i = 0; i < sz; i++){
-		if (d[i] == dupetocheck)cnt++;
-	}
-	if (cnt > 1)return true;
-	else return false;
+
+bool dupeinarray(int *d, int dupetocheck, int sz) {//checks for duplicate dupetocheck in array d
+    int cnt = 0;
+    for (int i = 0; i < sz; i++) {
+        if (d[i] == dupetocheck)cnt++;
+    }
+    if (cnt > 1)return true;
+    else return false;
 }
diff --git a/PG2/PG2.h b/PG2/PG2.h
index 75ec351..b248138 100644
--- a/PG2/PG2.h
+++ b/PG2/PG2.h
@@ -7,13 +7,21 @@
 #include <iostream>
 #include <string>
 #include <cstdlib>
+
 using namespace std;
 
-int main (int argc, char **argv);
+int main(int argc, char **argv);
+
 string getSuitName(int card);
+
 string getRankName(int card);
-void swapTwo(int a, int b,int *d);
+
+void swapTwo(int a, int b, int *d);
+
 void shuffle(int *d);
-bool inArray(int *d,int toinsert, int sz);
+
+bool inArray(int *d, int toinsert, int sz);
+
 bool dupeinarray(int *d, int dupetocheck, int sz);
+
 #endif
diff --git a/PG3/List.cpp b/PG3/List.cpp
index c91c0ea..594eed4 100644
--- a/PG3/List.cpp
+++ b/PG3/List.cpp
@@ -2,33 +2,37 @@
 //List.cpp defines the methods for a List
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
 #include "List.h"
 #include "Node.h"
+
 using namespace std;
 
-List::List(){
-	head = NULL;
+List::List() {
+    head = NULL;
 }
-List::~List(){
-	delete head;
+
+List::~List() {
+    delete head;
 }
-void List::add(string s){
-	if (head == NULL)head = new Node(s, NULL);
-	else head->add(s);
+
+void List::add(string s) {
+    if (head == NULL)head = new Node(s, NULL);
+    else head->add(s);
 }
-void List::print(){
-	int maxcnt = 0;
-	Node* n = head;
-	while (n != NULL){
-		if (n->getcount() > maxcnt) maxcnt = n->getcount();
-		n = n->getnext();
-	}
-	cout << endl << "<<Commonest Words>>"<<endl<<endl;
-	n = head;
-	while (n != NULL){
-		if (n->getcount() == maxcnt) cout << n->getvalue() << endl;
-		n = n->getnext();
-	}cout << endl;
+
+void List::print() {
+    int maxcnt = 0;
+    Node *n = head;
+    while (n != NULL) {
+        if (n->getcount() > maxcnt) maxcnt = n->getcount();
+        n = n->getnext();
+    }
+    cout << endl << "<<Commonest Words>>" << endl << endl;
+    n = head;
+    while (n != NULL) {
+        if (n->getcount() == maxcnt) cout << n->getvalue() << endl;
+        n = n->getnext();
+    }
+    cout << endl;
 }
diff --git a/PG3/List.h b/PG3/List.h
index 35c2add..aefe505 100644
--- a/PG3/List.h
+++ b/PG3/List.h
@@ -8,17 +8,21 @@
 #include <string>
 #include <cstdlib>
 #include "Node.h"
+
 using namespace std;
 
 class Node;
-class List{
+
+class List {
 private: // Each list contains only the pointer to its head Node.
-	Node *head;
+    Node *head;
 public:
-	List(); // List Constructor
-	~List(); // List Destructor
-	void add(string s); // Adds a Node to the tail of the list, incrementing the counter if a duplicate string is entered.
-	void print(); // Loops through the array twice: once to find the highest count, then a second time to print each Node that has that count value.
+    List(); // List Constructor
+    ~List(); // List Destructor
+    void
+    add(string s); // Adds a Node to the tail of the list, incrementing the counter if a duplicate string is entered.
+    void
+    print(); // Loops through the array twice: once to find the highest count, then a second time to print each Node that has that count value.
 };
 
 #endif
diff --git a/PG3/Node.cpp b/PG3/Node.cpp
index deadef1..fd61564 100644
--- a/PG3/Node.cpp
+++ b/PG3/Node.cpp
@@ -2,32 +2,37 @@
 //Node.cpp contains the code for each node
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
 #include "Node.h"
+
 using namespace std;
 
-Node::Node(string s, Node *n){
-	cnt = 1;
-	value = s;
-	next = n;
+Node::Node(string s, Node *n) {
+    cnt = 1;
+    value = s;
+    next = n;
 }
-Node::~Node(){
-	delete next;
-	cnt = 0;
-	//farewell
+
+Node::~Node() {
+    delete next;
+    cnt = 0;
+    //farewell
 }
-string Node::getvalue(){
-	return value;
+
+string Node::getvalue() {
+    return value;
 }
-int Node::getcount(){
-	return cnt;
+
+int Node::getcount() {
+    return cnt;
 }
-Node * Node::getnext(){
-	return next;
+
+Node *Node::getnext() {
+    return next;
 }
-void Node::add(string s){
-	if (value == s)cnt++;
-	else if (next == NULL) next = new Node(s, NULL);
-	else next->add(s);
+
+void Node::add(string s) {
+    if (value == s)cnt++;
+    else if (next == NULL) next = new Node(s, NULL);
+    else next->add(s);
 }
diff --git a/PG3/Node.h b/PG3/Node.h
index ce7f0bc..589acaf 100644
--- a/PG3/Node.h
+++ b/PG3/Node.h
@@ -7,20 +7,22 @@
 #include <iostream>
 #include <string>
 #include <cstdlib>
+
 using namespace std;
 
-class Node{
+class Node {
 private: // Each Node contains a vale, count, and a pointer to the next Node in the list.
-	string value;
-	int cnt;
-	Node *next;
+    string value;
+    int cnt;
+    Node *next;
 public:
-	Node(string s, Node *n); // Node Constructor
-	~Node(); // Node Destructor
-	string getvalue(); // Value accessor
-	int getcount(); // Count accessor
-	Node * getnext(); // Next pointer accessor
-	void add(string s); // Adds a new Node to a list, incrementing the count for a Node if the same string is entered more than once.
+    Node(string s, Node *n); // Node Constructor
+    ~Node(); // Node Destructor
+    string getvalue(); // Value accessor
+    int getcount(); // Count accessor
+    Node *getnext(); // Next pointer accessor
+    void
+    add(string s); // Adds a new Node to a list, incrementing the count for a Node if the same string is entered more than once.
 };
 
 #endif
diff --git a/PG3/PG3.cpp b/PG3/PG3.cpp
index 7938281..bdc93d7 100644
--- a/PG3/PG3.cpp
+++ b/PG3/PG3.cpp
@@ -3,21 +3,20 @@
 //most commonly entered words, printing all in the case of a tie.
 
 #include <iostream>
-#include <string>
-#include <cstdlib>
 #include "PG3.h"
 #include "List.h"
+
 using namespace std;
 
-int main(int argc, char **argv){
-	string input =" ";
-	List * list = new List();
-	while (input!=""){
-		cout << "Input<<";
-		getline(cin, input);
-		if(input!="")list->add(input);
-	}
-	list->print();
-	delete list;
-	return 0;
+int main(int argc, char **argv) {
+    string input = " ";
+    List *list = new List();
+    while (input != "") {
+        cout << "Input<<";
+        getline(cin, input);
+        if (input != "")list->add(input);
+    }
+    list->print();
+    delete list;
+    return 0;
 }
diff --git a/PG3/PG3.h b/PG3/PG3.h
index cbf32b2..7e826ff 100644
--- a/PG3/PG3.h
+++ b/PG3/PG3.h
@@ -7,6 +7,7 @@
 #include <iostream>
 #include <string>
 #include <cstdlib>
+
 using namespace std;
 
 int main(int argc, char **argv);// Main method.
diff --git a/PG4/List.cpp b/PG4/List.cpp
index d4e7d99..5bf3345 100644
--- a/PG4/List.cpp
+++ b/PG4/List.cpp
@@ -2,38 +2,40 @@
 //List.cpp defines the methods for a List
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
 #include "List.h"
 #include "Node.h"
 #include "PG4.h"
+
 using namespace std;
 
-List::List(){
-	head = NULL;
-}
-List::~List(){
-	delete head;
-}
-void List::add(string s, string l){
-	if (head && head->getvalue() == l) {
-    cout << "already in library. aborted." << endl;
-    return;
-  }
-	if (!head || converttolower(head->getvalue()) > l) head = new Node(s, head);
-	else head = head->add(s, l);
+List::List() {
+    head = NULL;
 }
 
-void List::print(){
-
-	cout << endl << "Library List" << endl << endl;
-	if (head) head->print();
-	cout << endl;
+List::~List() {
+    delete head;
 }
 
-void List::remove(string s){
-	if (head) head = head->remove(s, NULL, this);
+void List::add(string s, string l) {
+    if (head && head->getvalue() == l) {
+        cout << "already in library. aborted." << endl;
+        return;
+    }
+    if (!head || converttolower(head->getvalue()) > l) head = new Node(s, head);
+    else head = head->add(s, l);
 }
 
-void List::sethead(Node * n){ head = n; }
+void List::print() {
+
+    cout << endl << "Library List" << endl << endl;
+    if (head) head->print();
+    cout << endl;
+}
+
+void List::remove(string s) {
+    if (head) head = head->remove(s, NULL, this);
+}
+
+void List::sethead(Node *n) { head = n; }
 
diff --git a/PG4/List.h b/PG4/List.h
index 89b8808..6da75dc 100644
--- a/PG4/List.h
+++ b/PG4/List.h
@@ -8,19 +8,23 @@
 #include <string>
 #include <cstdlib>
 #include "Node.h"
+
 using namespace std;
 
 class Node;
-class List{
+
+class List {
 private: // Each list contains only the pointer to its head Node.
-	Node *head;
+    Node *head;
 public:
-	List(); // List Constructor
-	~List(); // List Destructor
-	void add(string s,string l); // Adds a Node to the tail of the list, incrementing the counter if a duplicate string is entered.
-	void print(); // Loops through the array twice: once to find the highest count, then a second time to print each Node that has that count value.
-	void remove(string s); // Calls remove on the nodes that match string s
-	void sethead(Node* n); // Head mutator
+    List(); // List Constructor
+    ~List(); // List Destructor
+    void add(string s,
+             string l); // Adds a Node to the tail of the list, incrementing the counter if a duplicate string is entered.
+    void
+    print(); // Loops through the array twice: once to find the highest count, then a second time to print each Node that has that count value.
+    void remove(string s); // Calls remove on the nodes that match string s
+    void sethead(Node *n); // Head mutator
 };
 
 #endif
diff --git a/PG4/Node.cpp b/PG4/Node.cpp
index 1a7fe86..7765722 100644
--- a/PG4/Node.cpp
+++ b/PG4/Node.cpp
@@ -2,51 +2,58 @@
 //Node.cpp contains the code for each node
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
-#include <cctype>
 #include "Node.h"
 #include "List.h"
 #include "PG4.h"
+
 using namespace std;
 
-Node::Node(string s, Node *n){
-	value = s;
-	next = n;
-}
-Node::~Node(){delete next;}
-string Node::getvalue(){return value;}
-int Node::getcount(){return cnt;}
-Node * Node::getnext(){return next;}
-void Node::setnext(Node *n){ next = n; }
-
-Node * Node::add(string s, string l){
-
-	string lvalue = converttolower(value);
-
-	if (lvalue == l) return this;
-	if (l < lvalue) return new Node(s, this);
-
-	if (!next){ next = new Node(s, NULL); return this; }
-
-	next = next->add(s,l);
-	return this;
+Node::Node(string s, Node *n) {
+    value = s;
+    next = n;
 }
 
-void Node::print(){
-	cout << value << endl;
-	if (next) next->print();
+Node::~Node() { delete next; }
+
+string Node::getvalue() { return value; }
+
+int Node::getcount() { return cnt; }
+
+Node *Node::getnext() { return next; }
+
+void Node::setnext(Node *n) { next = n; }
+
+Node *Node::add(string s, string l) {
+
+    string lvalue = converttolower(value);
+
+    if (lvalue == l) return this;
+    if (l < lvalue) return new Node(s, this);
+
+    if (!next) {
+        next = new Node(s, NULL);
+        return this;
+    }
+
+    next = next->add(s, l);
+    return this;
 }
 
-Node* Node::remove(string s, Node *prev, List *l){
-	string lvalue = converttolower(value);
-	if (next) next = next->remove(s, this, l);
-	if (lvalue.find(s) < value.length() && lvalue.find(s) >= 0){
-		Node *t = next;
-		next = NULL;
-		delete this;
-		return t;
-	}
-	return this;
+void Node::print() {
+    cout << value << endl;
+    if (next) next->print();
+}
+
+Node *Node::remove(string s, Node *prev, List *l) {
+    string lvalue = converttolower(value);
+    if (next) next = next->remove(s, this, l);
+    if (lvalue.find(s) < value.length() && lvalue.find(s) >= 0) {
+        Node *t = next;
+        next = NULL;
+        delete this;
+        return t;
+    }
+    return this;
 }
 
diff --git a/PG4/Node.h b/PG4/Node.h
index 3a99295..19c6b22 100644
--- a/PG4/Node.h
+++ b/PG4/Node.h
@@ -8,24 +8,27 @@
 #include <string>
 #include <cstdlib>
 #include "List.h"
+
 using namespace std;
 
 class List;
-class Node{
+
+class Node {
 private: // Each Node contains a value, count, and a pointer to the next Node in the list.
-	string value;
-	int cnt;
-	Node *next;
+    string value;
+    int cnt;
+    Node *next;
 public:
-	Node(string s, Node *n); // Node Constructor
-	~Node(); // Node Destructor
-	string getvalue(); // Value accessor
-	int getcount(); // Count accessor
-	Node * getnext(); // Next pointer accessor
-	void setnext(Node* n); // Next pointer mutator
-	Node * add(string s,string l); // Adds a new Node to a list, incrementing the count for a Node if the same string is entered more than once.
-	void print(); // Tells each node to print itself and its next
-	Node* remove(string s, Node *prev, List *l); // Remove the nodes with matching string s and returns the new head
+    Node(string s, Node *n); // Node Constructor
+    ~Node(); // Node Destructor
+    string getvalue(); // Value accessor
+    int getcount(); // Count accessor
+    Node *getnext(); // Next pointer accessor
+    void setnext(Node *n); // Next pointer mutator
+    Node *add(string s,
+              string l); // Adds a new Node to a list, incrementing the count for a Node if the same string is entered more than once.
+    void print(); // Tells each node to print itself and its next
+    Node *remove(string s, Node *prev, List *l); // Remove the nodes with matching string s and returns the new head
 };
 
 #endif
diff --git a/PG4/PG4.cpp b/PG4/PG4.cpp
index 9f2c834..f22d57a 100644
--- a/PG4/PG4.cpp
+++ b/PG4/PG4.cpp
@@ -2,39 +2,43 @@
 //This program manages a library of books by title, stored in a linked list
 
 #include<iostream>
-#include<string>
-#include<cstdlib>
 #include<cctype>
 #include "PG4.h"
 #include "List.h"
+
 using namespace std;
 
-int main(int argc, char **argv){
-	string input = " ";
-	List * list = new List();
-	cout << "cLibrary Version 1.0 -- type help for a list of commands" << endl;
-	while (converttolower(input).substr(0,4) != "exit"){
+int main(int argc, char **argv) {
+    string input = " ";
+    List *list = new List();
+    cout << "cLibrary Version 1.0 -- type help for a list of commands" << endl;
+    while (converttolower(input).substr(0, 4) != "exit") {
 
-		cout << "Enter command: ";
-		getline(cin, input);
-		string lower = converttolower(input);
-		if (lower.substr(0, 3) == "add") list->add(input.substr(5, input.length() - 6),lower.substr(5, input.length() -6));
-		if (lower.substr(0, 6) == "remove") list->remove(lower.substr(8, input.length() - 9));
-		if (lower == "print") list->print();
-		if (list && lower == "clear") {delete list; List * list = new List();}
-		if (lower.substr(0,4) == "help" || lower.substr(0,4) == "halp"){
-			cout << endl << "These are the commands that this program accepts: " << endl << endl;
-			cout << "add \"book title\" \t--adds a new entry with book title as the name" << endl;
-			cout << "remove \"search term\" \t--deletes all books that contain search term" << endl;
-			cout << "print \t\t\t--prints out the entire library in alphabetical order" << endl;
-			cout << "clear \t\t\t--clears the entire library" << endl;
-			cout << "exit \t\t\t--exits the program (also clears the library)" << endl << endl;
-		}
-	}
-	delete list;
-	return 0;
+        cout << "Enter command: ";
+        getline(cin, input);
+        string lower = converttolower(input);
+        if (lower.substr(0, 3) == "add")
+            list->add(input.substr(5, input.length() - 6), lower.substr(5, input.length() - 6));
+        if (lower.substr(0, 6) == "remove") list->remove(lower.substr(8, input.length() - 9));
+        if (lower == "print") list->print();
+        if (list && lower == "clear") {
+            delete list;
+            List *list = new List();
+        }
+        if (lower.substr(0, 4) == "help" || lower.substr(0, 4) == "halp") {
+            cout << endl << "These are the commands that this program accepts: " << endl << endl;
+            cout << "add \"book title\" \t--adds a new entry with book title as the name" << endl;
+            cout << "remove \"search term\" \t--deletes all books that contain search term" << endl;
+            cout << "print \t\t\t--prints out the entire library in alphabetical order" << endl;
+            cout << "clear \t\t\t--clears the entire library" << endl;
+            cout << "exit \t\t\t--exits the program (also clears the library)" << endl << endl;
+        }
+    }
+    delete list;
+    return 0;
 }
 
-string converttolower(string s){
-	for (int i = 0; i < (int) s.length(); i++) s[i] = tolower(s[i]); return s;
+string converttolower(string s) {
+    for (int i = 0; i < (int) s.length(); i++) s[i] = tolower(s[i]);
+    return s;
 }
diff --git a/PG4/PG4.h b/PG4/PG4.h
index 4e91566..85eef4f 100644
--- a/PG4/PG4.h
+++ b/PG4/PG4.h
@@ -7,6 +7,7 @@
 #include<iostream>
 #include<string>
 #include<cstdlib>
+
 using namespace std;
 
 int main(int argc, char **argv); // Main...
diff --git a/PG4/pg4 b/PG4/pg4
deleted file mode 100644
index beaf801f940279446255ca1bb7efc842dd79b64e..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 24814
zcmeHve|%KcweOyp3<SuJQF%6^!hoPiO`1S}*a}V(1|}LXW)eg#o=heK8O^U|CKza~
z(GZ?fh|O)SMXSBJwYTMZTgz*!53PnM)KEXKHR{us*4A?E)y@c7>JOw=oA+I7?>%$o
zWXAUP)6e~j4LNJCpL^}K_g?4MoPDdecCFoJ6S~;NYC+g|p@&KGC`4-&ql#7`W(bd%
zC(aYoKyl*F!yJOLrr{}NTEko==K##XUxi%~D(oJvXn39^qXk*ChXkp;RPm^)gzY5~
z)ldjG6G)GIomj;vU=vp~^pQg-eM#eP#>qX>%U#VVU=vp~JfR%ZQ1_4eMt=>ee+_mI
zFv2|q#2P-PAjwjxdo9{R^*b(P6wt#J4QH$NG}L-mLy!FYTZ>Bx)~oii#bvSbUqjWr
z_*7fCc}4lB+FFX+!W})m#l00PidU4EL^?~Ba=*zw$*$Yb$SvtO76BulXXB4TPW;Me
zzx$`JpZQ$D>_c1U?%vee{zAt?+le<He`G`U%VnQ$n{6Z70{mTozsTLw?ejl+cgAAx
zi?y@&=2dU6x#<y*GnQI7aApQh6b)pe-woMJbn2HogPnO<=o4Am{UYQu*&od!zW@Qr
zBtMYF{~u+sQ;@|@OBOqeve1`h>F-Du`8`?sdsP-YXJ)Z8nZ?f4S>(&I#9?a|`m`+Z
zxjc(}IE(-1X0fv|i=8!D{6CO|{$>_CE3?R75BeEmj&N5t!DAtcfKxfC<hxY9msBBs
zj|$DV{RJLPV)&4<<Ed(5+@<W?qwEY>><HwENVFyR$xl*lSRo8!YkOyh5s3!6qlO`j
zE4CT+p{?OaG}K+)7KlVb5n<FctT$Rh-HP0>zPhcmBh(ORZVO3XW{%MnZS4*PT8x`Q
z+l?S<QHWo+;Yxp`JQCg!@@^x{A6ZkzHGg#F)=(6=D^wHoN6X5Bt$}VM+8qc-BQ-&<
zKY)X`9*kwpfk-%Lz(H7SuW2wEN)4}nrBUy1uJM-}{^dqPnc-#A(TZ?q#DILLyrv@@
zRSluZ>N0QLmBIQe*{bqsWw5ioE6^Pxj&^fPxTD1ju}HggHQ;BA5poE2R42l{UXt-g
zmj%NeN_|CJsAFriRf@pKibxM4-|cN@Yak?>q$X$}dV7toP<N!WBhVI(Za21-vdQvb
zXHOKhj+<o@ZIPO(0W!y?Q^h9OfXFO2WQY9G@=!-hTc+S<(p7O?ff*r(tR)Z)sNPc7
z(}F33(AgI8)~&7gcltU0{wN&%TZU4*n;Ob1r;a6!nG6%=jAdZeFtoJQZKK(}H5fD^
zG`Y)!(b#b_#t<_)($gLyW>C)hXlGmJ&7p1tJ=hyCFf)6@QPCc154LxKMsjLJv<EPr
z>#D1bWhJFzU2RQOwXw8hX~}X?y=hZrRgF<rvP_aUZGuQSEkQf~OVu2V%cJCK8ImMA
zoq45}Q$fPym4ppv+}}b(pXcf>+&+u0xXO{ws1W}{6TfFpcm~<KEXlV+Lh6(J3qQCC
zS5!HIuCK^u^y07J63H(7O8(U4O(e$WczrEHxXx2_IX0gNs_48!^o5!TSmbG9Y&woA
zB{A+c(W&RUEH=@VE6gf2(aru;nCRx~ERTs!ZR_GQ(e*VU@#;);1TI-Nndmc<R3Vy7
zbPPnYw3_I7NvaTCCVIY!-fN;4nCN{b`UNKX9VR-Bn=V5p`Wc!CxYtBK%S0bG(dn8`
zmwhJs|IkFh{U-X^Ci(#r{SzkosEJP3mbx4<(a+IDz;P4(ToZl5MA!Em#6D`GFEGi+
zP4x3k^b;ofA`|_Ti9Xjv7nMzn(cGbHNL_MGbhjn~`udOO`gS{4Ep-duz-ZJNzmkcE
za}P<O$>mGInp{+lW8pjxYJ|5EGjVhhWziDCX^AAp8DBs+Esew|<8ugi5Wb)BGYO}q
zkQiosCgHUF5<`sJ38y8I=wtkYGT_vmL>J?46HZGY(Zu*0gwxbd)G_`l;WXtF9>#w~
zI8F6LDdW!*PE$PLX8ak#X=*22j6X#<P3eSS{4v4{2|w`{5ElKAa2Mf68Gn#)n!1T`
z#=k{4UFsx88NZkCvk2eM_*V$0shb#P{7Zz>luZmVemmhbRTF)T?;xC}XrhbpZo+A5
zCYl((k#L%li8{uc37<o_hw<wOr>U7JWxSqnnvw}O<5v()Q!e3Ryozv|QV9XP?9H0k
zb2s>6uloA`^F&=k&Df}Cp-1?}o*ch`z}OQmkBDCb!FRV5&RZkIfr~KF8hyo-Z+-oz
z3VgBGZnkeebO82vg1x)>Ah9No7S8J<+5y6}{FA2~koU!&@;&*+<v!cE@3~VwP=1UA
zeFM)&-`(tsJuUTLRr-Caeu?=add_HsX8em7pv_M^p9abH&LNtwzW!CM#Sn<jO}a3<
z@t{}@?_#e_j&DwU9x8?NL?Qx6HYyt{8~nc8j>pkv?1?;3eX)mWCin)uqrTW!{9bg{
zH`qAp8yuhsGqQ=|0s7k?rDRq><{-_{_#Tpu9rDF~8{dsd?2Bz4A8CTdK|1lo?}W|>
zT`H4-`4CMcuu?|uNeZ;HQEo_gJ$}!J)X>+carjWj9==2dPB3GDraky3#w%D}Nzt+R
zVrjIA<sK&SM`?Y^FvHGbX@~eD|E7BPz%+#85R9-EgnkF1oi7*eybGEt6y(Dm)~)*h
z(dzRJvT<MRxyNXI6Z_|XW~bSApf@C?2fCy;l9N)nj};nWYmg;&d&hmTUy!NW;Sm~U
zDo{V0LZhg!ll39xz@v~%_3jF`=p7pQzUtZ$I7eOc4w3FG=<a+uy57{M1FTW^K17C1
zeWLLtjX!-reQF%`v2Q#QdB{gB4fbQQ%M|93AFC!C(d5q2Xr5FVi+8}5um6^D5uJy2
zS@ba_x<rajryDnM%*nGDs!M&lH;?-UUXHqGYORG3!EeG9Iqzmu2;{swi<z4zegXrc
z@^L!CxBWUel!}u>Ukn33p_WKuWK{X^9mwn)?Wq89G^5(dKTS?nKCbjeM}DgGI#@57
z=6hxAr{10aiLR^V^bNF#c;{oV;1lBYB@nzj-z?nuEZpG5A=io>aU2=f0fbO;;l$0z
z%Y@`E(ktu|Gw&cFbxEGf%zJ>4y-D7?=uxtP|4F=wByYmZyNP(>LfziuX5Lli2C9Il
z!KH3K0KwEMcGK*S@!VO$jDb>K4_`AeitIEjYI#3Q{72Kq?sKP-4UDXSL)6M)=<u?o
zIYop^OxA&(FHzabSiArz7WKdmnzQB!_8PT~3APGt@H~PeE@kqUpv5K<H(~f`#;I{#
zMwVj})aG7PYhs5<|D*ROCu?KBODxpFDu0c|zX~gf{3KcX`voGOqzTF0Xi{y4i2UUw
zSto%FARogyguLjZrpe!9H%bC8?@Neqtt1SS#JNQ9Dfe!W?j5VBvCPu<z*rwUe#`+u
z%+|u>Z2dJD$81CBlWJFv4-7v=oXe%#x;GCIP5LJX7;^WTXnGuWnP@u9-Jq#}u7l6M
z+YZwy>iWvhR&L&Wh|XMoT+1!?#cn~&d&bAS$H5iHJiEQeeZg^GDmPunb`DLUSAkym
zh$tKxg;OCQcR2dJ$8Az`EdHaDlartE9xwdoQDlM#eY+dUCYs_oyA4c6`wuU^UU~y(
zT(Mg|jP;!AzvV+)&qcT00;h4Jo_p}>YMl9IL*ua`ocl)zJxGs*;vUd`#$6d9(Swvv
z;`=e;DU0adDRl1y+Q*+4b#5OSPV}F!No8s|i`;6oFfdwp*XYj<4N=HgjLeL|fDoG{
zl>%7=RvazhuPB*jLn_U#d=K62KU}1`DlZxOkM~074tR%|_qATQEf>me?;XC~eC=}?
z?4j<$<iuQL$J=31=G)z@Vq(3Hb21XWC3({9<6OzJ`35*b*>wJhFPVWp4O%jD{TxWb
ziN$M9{wa?(q&&i6V2@r#PD!2t__QYJ_u`^KrTC<)`<2eYjIJj0Jj5`6-c99sUU=UE
z0eL=pHO8_J{T^4wmVjP67#crF*SPUo3N_ZV@;UZYZR~YQB-_v=6JteEcPxH26cguA
z21z=oZNBsl%};J-R5f#mNpfrkF_{O~gTogVm52a@F_Lze26Zfcl7!jCvG^OPCw>Uu
zOsQaqgq{O~Q^8Tf9)LHdEW$DP0VJ$hWSE5SPE&1VRnC_`f1C5A&S~h+SUe12l?YZt
zQsy#t^C~i<(jSYiPKlmHqWy<^O$kFU6w^ueekhED)XC!n8c)uoe&Xm$)oo;#){UIl
zg}M&!uEmTt8LWk*T$X9+2?`TRIe=Ir{9Z(jC*Tsas@c06CwzlF;5?VSLaC-TNOT?@
zu*Tw>pmA)Di~|$akqLS3IgdP*St+&RIf0P(NFp&;D!XLPSM}A%S1o_k`HE1PuZBST
z_<ZF~=Al?4G70^yS9y!4+FUp)EznJe%v*6}kfR6y;8^@OC#WYh{kdbmAoS8hJ=L23
z1PFBQQv5sNkrZd`TY=W%)-Co5*=j{f8W`<KODG793o{}Wf~3Rg33dSOAaVXP5~ul8
zBYllwG_=2efCHR08{sgI=Y!;vBw^6%Tymt8{QcZN(8uE4Bxf2aOBUYbN~Ymg_#)u9
z@%_3nXg9!6n&s-0<sxaB(zToe*-sGPmnKhH&JVjixmuS_Ks@t3dg3HcNqR=rDUKY|
zE`)S1#&pORLr&S<xYsn-S5tF*SCI_YQaZQuY8Z>(%HBYWL}WC_k%n<rn1QRay@|P$
z?Bt!t9g2TGk{9^v(2%-D;X!!uEl#TYWm0{g?DDLFV>+WQq&ro04L%J5iBaS@bak(9
zw+FEw?ZL@{ZH}s@Zj&}grOgMVO<t!eM?X*ZnPeb_!Bd&^dr%_ZkA+~3I;N+|GG=fC
zNL}o-n@P%nK}2Y9Jy^VO?k8s{ma!@_4KngSiL1zYRWra5xv}_i!f}yGdE1mI=1MY2
zyu($xaAbv?6z7+ys_VnmZ>FW={iOIS(2lKD0_Ud-jFP~kB(O-f%8u?Mf=bgzN#g4!
z0=K>k1eL(9CrA1ZcTHWTeEIXVygB+;C?vD<1Zk@|N)Pp1Nrb$?;!(4kR+ta7^9W`q
zJZ(JSi>=>}s2-6~<T1GKIBZdXDgJU;hUk>6;`|$8@Ae*1b0mtyL{CPNqq^D5->t3p
zaId%1GN#t#7&2{;<#8%TlPcx&czcP?GZx}w@e2vP^iX6T^63=WbHKFREw4)Y7^5pX
z_&ertVJgr~_Yn~-ViN4`<oh15QLjHn?rn}A%fXRC!ee)wsIiG-hG`Z}NE#`9U-_w|
zM^c=xCOO>EZ-b-f02}^lO0<<k`w#p6>Xo#=8fT_w-q2?zLgkt1BxoOhW^!do^!GvY
z$@sjV;o(^y;v*`rsf<llZmfx&tZb}_y;#{$JGkh?Ic_|%8!XP9;}-tfi(e~y+4tl}
z4os%p`1ccVec;XL+`@S~NnO;&-l&b8Tmu`Evw!XDKV<V=daUOS^e*@M&2;Nhc|)af
zXv>xoE&t9T8WcQ}h6Jj3_kxR86gMA*2-b$1y93?Z-5c?yG2GeVE-NW@7Z<yu+q**U
z)=*oQdrN1xJK%1^8&-Gc7B^mtwg);|BEs8&SHc?ov|9vPT10oKy>nYgbajV2q9WK9
z3UmuHAzA}C$kNaniiF&FvFeVthO~MFNFa(sIO6W=?%diPXm<yK!BAH;0?S-r-o2o?
zv-2i*G#qUUEpX2$E(R?E*E&KsyF(pO^x@`kwAGywatFw8$lVdZ%RW`4i|z#xI2UYn
zqYv$Dt0mMHiiTjWt&J@xmx7%gQM~eVo5ZCd?xTCg47kD7h#PNZxiz>FM)&a2kmCwv
z^u9IF9Eyg6fi`z%H(s41?i3xV&sFJZx-PXuZz81_)ufaT(c(Z`q|<FuS8ZO*TB^ee
z1ls7``*t_nQBo!DKyznzG}KZe^c<+gAg8M(G26M0&(Lq0=7Zw<{p4g5ohmUoO97W-
zj_(8f11=FJ0B^zdfd|v<F~BCkX8~#2y$|RHT!5>zVZaK&QNUKfqkwKCLYG5`I{`}p
z>7I5IU@_n*;EjMs0dEEDgZ%dZdx4kY=6V>A?!@Ue=?LIrz#^Rb>j0|&y8s&ihXA(#
z?g#7x90z;}Pm)dnx{<Ala5+4NXMIh8IXK_a@6FBu^Z@z*hXD@&#sR75cV@O7^}^Qc
zvYneZJ$J}9-9>bIDd37vPA(xqRWi%VccmnM^fehPQQ%rzP;^D%tebQD#N~57vt-%A
z1!RI`sMvPY)pCo|9rTk9hiq4fOTb%*zX7!S*fjKE&m|sFS>W1bug;%VJLuSx)9-Zr
z+cbDdR;27*fQ7i+xRVH4*4yu}?@WquyY#4Y404OjazQCWe*GGM&w|hW)pkND{)gZ%
z2Y;1Wzc<A{4|As;e16}k_3Kjn%fNph_aDV({nix!v*7Re82vAR-vxfDSs(q}0uvNB
z((eQR0OnSXr#Kb28Wpz(?Xoe*Qh)ys<a051JIwa%VV0pW_#XHh!5=_9=U$UNitXo9
ze$PgGKZYE?2i5&<kbJUJ4*n(R_fB&=>-ISMbL=X5(x1;l?heRhi~kqE522lG@xKrJ
z+riHifAWL$>tR1g{dvgJpKDY8ej9RkLhf3U8?ne;mFjmM*6b+cE;je8CB?r4{Aa-D
z_t-ivwJClr_>Y5srdfY|ir)tQL*UOb^BX0f`a}Brz^C7Q<^00rC&$)t1&ub1^N%6-
z5^_?F*^Ye;8zMV*fiIAYzKikBSzeNwHyCHf{Wg{(J0C*sIm%6DJErw>UXBn3_}Rwi
zGVs3uex~tR1Dl@(e;E7_*{>>aecA3UD7w?(EpQL!cncQqarz2McTMvZRP;|@U*Ksg
zsHiL`tt?nvRp72FD1v-dK`!UBZ^O<J*g;s*%H*W&2e!+cPtFwe&M)VS&CZu+iY`BD
z|Ig-pYo>VJ<{X$McG;Z=^TfS&=Y6xpzuP~9`U(3*W3$Bf9L^uj5<hV`Q6F<G0R26O
zb7Ge0&smB3ksN1YmiWIppGW;gr}KkZ;<jo2FXf4Mra2$T6FaB>#s<c*+_`A%{u$0c
z=ZPm~IDelfo}1x(Ay2%@^*=JbZzjn+Jo7>!zMGF64WBozcK_KSZUJT7cIo{&VxQgl
zNRD{ae!jpjX`JyK@xI+Tkt4q3a3i%loL_Z{=N-=5o#HjF|Iq;}dvkDjfes(hVV@HR
zSay99@Cs)OLLtO<Ny|GA@KeqzagD;ycUFip)YnTqxCpSq`3;9y<9yg5uDR?-IpRK>
z^S2K1ziiHD9pVYw5>QUqoP9Z>-|jr&5MQ^?1?7<4`K=uBirx87IpS@u|HbYE{Z8_4
zKOLT-0|Lpem0tw-Y3Gx6vDW#rU2Jjga){e)&iCx%Zre^9kpFFmz)N&EL5FXU^67Fq
z0;eNzIs&I7a5@5~BXBwbrz3DW0;eNzIs&I7a5@5~Bk&K6z>v$s_Ns~`eEU2J_go-h
zm*TS!4tTW0#R}<LAS#;vp~CYdS?tgEaE*SDPh|~$@JU5~bD_VlK9{L@2Cg7KGeiB<
zswSq;^D8Rqv9WmXFO!{w@3ngf2>tY+X`00G=$Xs7-NTSRAfRH<voaL@tqlDri3&f{
zl2tw`F(EunjO%AnaaGaJ(WfgN{msddnI5KSdY{6z-##TzA2?9a?c@D7_s6B=@h+8d
z?FU|MFg`lN!+QT+2mKwpwY}H#r5`61oK_(5vlYBh!4(RwRdAz%TNK=;;4TI4R`5Ft
zKBC~$3cjS^>k6J!a2j4hP&r${3l&_U;93PYD!4_#Z3^yE@NNaaqu?V7KCK`(Vmjbk
zyidCqH#YZlM0?!jB^4#*#Y=k_EBj(uc}Zz`$+C+jU5Jv%_V#F?88F%{VXLm;g=MI_
zOO$kUMnfg|kgqrz*s8Ft9X%z@Jz;!FA8rvPgtZ1Dt)ir5dk5@E810svZSo~*8e)Lg
z9cl}Zf~s}3MMX&%-=K;Td}@dzzAO!c*GXShijq*Pu?4R{Lq=;0bTtN}_>wWyORq%@
zxR0-G*@hA5?hb61Hgx^QAQaJFpgkOfUMHHsp@iF&Z8S$BqJ&=N;+3N*oPT$f@(1N0
zy-q9a9$=~cBXs^?A`UuVY5W3IXw7Q<2D=AXYJUbdW2plkQKywMU}pWO-NXE-GPsbj
z)WNF11}r?n@6_$<ytY>nDwL|ub2^`BiyKg(oTl}4-WykhA(codFH+yNzRo`zK_d~Z
zuk&b=N~Ah(LWGMoem8(hIZNy7JT<BkU9Hm7{%bi6ZvvlkpvH9`bg9Ix-`|rv<fryu
znH4)wp_poYop<|`zE272_O-t5|4xg(&f`avzRvrkpNBuIKE1o7nCSD4KJV?%2N6Y|
z&m<;&)pdd~{F(K~RbCxe`pJ$dC6@)>Wz|>tYP?VicF$G{7ClY97Zr2+`aHd6p_I_)
zD=km4HkV-_q_5*&x6lI&-?J+H3e8|@Dt-zT`%p3K>-|jhJ|}uV6D@CT{}GG+@I@XL
z9ll6v9JeUw@snJ<2Sml(KE1Z4vgZ;8;y;LKDi%~c4_*QO)G{;eA0w6A5+sk-_Fn;q
zhDz(}>z-5mGHz<Ttom<2mweLt^hF$()e>0ct@s}xrq>o}=<~kb*GBJOqvyBQ*Yofc
zbj<DR@3v1}PS&#fukCyU8MD5=?h+o-#_t#`0oQsOP6OYp@2YH)dX)_L+j3cxN3Ex6
zc~B;rjvsx-NX4!6t@GE-+|=O==;OaAO_8{!^*?E$lPnbt=^e9fn;GhGWu>gl(SnL@
zLD`OFiLvD3E2P2%B`uV>_`3{$y8k-=(fZERzPJVql(#Giz}mi)%6xRdy9&E!3X^sj
z(C1k*(*aNP`7@oKlf2$fr#r>C-D4(k-GLdc&tqn$17~V|eoCk33Vq&5r_T`je3DL|
zDfD?Fojxmh-;++y6FRS_)AN)2X{FN(lJ`sL^g`rSkD0`E2WGj>n`Wj1JG<z7m`*<v
z`ORY{aor)#O6D&!(}B11IxnTuardP2jfvq9XD9QBiHy<xgwXjRosQY)X)=?z?!eum
zUe9Kx!?a&bI$hsQrl>SubHpF<8B%(oWnrVcKa2l#e`*&v`C9ISOBB7-La$VG>wPmV
z9~=Cvt8PLqwcfXIeQG=hL8o^0{W<ASxd(r?4C8VD^i2I4W%)URzQ&@W*Xy&WlYM8A
zhsa_TA93vlNOb)?K;I9a1w|XqOr8rpEUEJb?ML)+?bcT}vAnh2htKmcUAMa)0@SX4
z{$Opl*V1nIue3|QnWbWF_o@p#OxNvpt9JGC4r{x8mUhWrrv82f3>((h9hP-8%=D@A
zik!$~hkmPNqo)Cu`TrC(jB&TFyB8FFVpS6fB+Kh;XX?891L*Dy>*xc}Gwu82!pUR-
z#%22X9=2VqT37-4naS2tmGw-|7i;Hwm`K09qH>+0(=G#4fO5G}(Z|(wsv?WeF<oOR
z_~k5gxzAO;cvblsR4RXgygQ|ytmWe*mx(?f^i2I)&h&hdJI}*5=(k!_)-io*eqNu&
z4(*tc$^M|Sf3{i|1Jb-02A$%6t6HZ^6#d04cHUKXhE@D8R`R*H?#<Nh#aZapS?HUy
z(062^-=pZ({lP{+cPrn_;8&nie-Ef})cvL3P-XJJ9`rMim-KlM>RbXWpD*50anSc&
z+p^dh1l_H4&EUJByE3eoA1nJef5OA!cPgcyDf+&1CA~w@f2HX6sqv-r3YE7(r~a0!
z{_d1y(Tof1GeO@s-@_F8O&^snGF{fq$8UmuhW(u6en^`4U>5mjNFL`S+OC3%zOMcc
zmd_WXYQE{~*tZn@K}FYj^3P-k?b0W|=8}ttAmsnARs8kXoy&Byq^vJh^0fU3l@K5C
z^Fc+ou4_N&6t{m-@{5)HE+zkrYL|br3EsV+yE0rSe23+gvI#tyg+2!-KI)e>zg@(1
zlL1w|EDL?3vSW>B5OnucGon|?TgPP}i~V~*r~YoLZc4NE%`EbdD|(kD59i=|pXR^5
z57NeFfv(3?(+Dn7^dXC#wM@?!H>mksqm-`6V&}#z^xL!0?_+wtIHBez{dStlL!i?<
zxkk|!OS1T#lBa!csL*fJsl=I{;krH89gReL@I?!@;WMtNt~Y9H{0-QdFtq`p5p6eu
zv;|=VAE3ys3QZ)#Xz4VzwskfK+KiTHXLrO1^z;ha-H$%_Xen87>B?oWoI%K-r?T>i
zs=?ov2>DdDrKi1pJ5)@VK@W4&MC;a-mjt`8dmJ_atgSGNa3??SHLfc!GiWb4d<?=$
zVeIX<0~q#P#Ah|wRuNC6dxDIYhQq>GS9?`eWi3>CnvEKRx1TevyRNnjCb5|y@241m
z__mPIwavS<bSf2(rs=Z|=}fvcY~@!@yy~Uc$!|kvODLNV@gU@n)cLUips}{Ta=q8^
zZdgMbMDm!Zx-x&&+O>W!w(qN~s`ZjYT5wv@3B1vyFxFhVp>lmqwV;R7a;rU#9BrTI
z@$f!-YC}ERBXY`ikjb4BvA3arsiC%Kq<sLVD3?=T)=-DlzJ9?-4-d3RHcMMlrZ#7^
zTKLCqOlh^gf&GK$I@W)EH_q#5qr=R0mf;I2Sfbq|`3-~GyHRepIYlMYK8jO>c*3lZ
zUs1s{k5cG!**A7<#x9M`a$8Q?h_miW|1z2q_y)<mrJ`y^?WIWbl7^`QJAiHrwDqXH
zL9JV4PVtR*@}ylMEgaLPj#C<<vDO=NTGZr5m#IxZr?9O7qfIa^LLawPDl)^?=-(VU
ze+A+OmA_-VPpeN?VXC);JB*%42&+*Adu1dP?ZC?@FRyXE6RTAfJHP52o4)U>k+yQn
zut{kLUWP^0#+p1)WU^V#pUcUuLwPb$!>#x>&0EKVo}5wM4VNODb@X8LddrYBLml+a
z%Ls3&*%ayaN5Kq74B8eJv&*~EFyu^W_O37t`goDH2gMe!%M5F}0EzaGCE)c}Q&8n>
zOHFD-ppIQ5o_W?Gy;uTbAPPDYQp~V&A%v!BQ&fvA29Nh{wUT9A^bV@2jEs{~q|<1{
zX@NG@)x(4}!NX+QY1U#;E-uPz>Xf6BN-}}dEc&lbywr-s_Ol&P&YyUPn3golX%0+T
z0&>p&BX)kZ^ixHI1E=Phl1Swd9)}F;61sfm;~jgm>`crOe5#N;!CH)C`&=3ozj>cq
ztA~H@F1r>xA%15|jp=QMEdm+#3ifzRThi*;V_JOJKG<R;ZF5}k)GoKwY(#B!Y|&6r
WG@WKJ*dMoJbH=lQyr|*1`u_o*?Dd8K

diff --git a/PG5/ArrayLL.h b/PG5/ArrayLL.h
index 4bcd495..a81198d 100644
--- a/PG5/ArrayLL.h
+++ b/PG5/ArrayLL.h
@@ -8,46 +8,52 @@
 #include <string>
 #include <cstdlib>
 #include "ArrayLLN.h"
+
 using namespace std;
 
-template <class T> class ArrayLL{
+template<class T>
+class ArrayLL {
 private:
-	ArrayLLN<T> * head;
+    ArrayLLN<T> *head;
 public:
-	ArrayLL(){ head = nullptr; }
-	~ArrayLL(){ delete head; }
-	void sethead(ArrayLLN<T>* t){ head = t; }
+    ArrayLL() { head = nullptr; }
 
-	int length(){ // returns length of the list
-		int cnt = 0;
-		for (ArrayLLN<T>*P = head; P != nullptr; cnt++, P = P->getnext());
-		return cnt;
-	}
-	T remove(int pos){ // removes the node at pos
-		ArrayLLN<T> *P = head, *Q = nullptr;
-		for (int cnt = 0; cnt < pos; cnt++, Q = P, P = P->getnext());
-		T tempcontents = P->getcontents();
-		P->removeself(P, Q, this);
-		return tempcontents;
-	}
-	T& operator[] (const int pos){ // overloads [], which returns a reference to the node at pos
-		ArrayLLN<T>* P = head;
-		for (int cnt = 0; cnt < pos; cnt++, P = P->getnext());
-		return P->getcontents();
-	}
-	void insert(int pos, T stuff){ // inserts a node at pos with stuff contents
-		if (pos == 0) head = new ArrayLLN<T>(stuff, head); // insert at head, with head as next pointer
-		else if (pos > 0 && pos < length()){ // if inserting not at the head or tail
-			ArrayLLN<T> *P = head, *Q = nullptr;
-			for (int i = 0; i < pos; i++, Q = P, P = P->getnext());
-			if (Q) Q->setnext(new ArrayLLN<T>(stuff, P));
-			else P->setnext(new ArrayLLN<T>(stuff, P->getnext()));
-		}
-		else if (pos == length()) // if inserting at the tail.
-			if (head == NULL) head = new ArrayLLN<T>(stuff, NULL);
-			else head->addback(stuff);
-		else return;
-	}
+    ~ArrayLL() { delete head; }
+
+    void sethead(ArrayLLN<T> *t) { head = t; }
+
+    int length() { // returns length of the list
+        int cnt = 0;
+        for (ArrayLLN<T> *P = head; P != nullptr; cnt++, P = P->getnext());
+        return cnt;
+    }
+
+    T remove(int pos) { // removes the node at pos
+        ArrayLLN<T> *P = head, *Q = nullptr;
+        for (int cnt = 0; cnt < pos; cnt++, Q = P, P = P->getnext());
+        T tempcontents = P->getcontents();
+        P->removeself(P, Q, this);
+        return tempcontents;
+    }
+
+    T &operator[](const int pos) { // overloads [], which returns a reference to the node at pos
+        ArrayLLN<T> *P = head;
+        for (int cnt = 0; cnt < pos; cnt++, P = P->getnext());
+        return P->getcontents();
+    }
+
+    void insert(int pos, T stuff) { // inserts a node at pos with stuff contents
+        if (pos == 0) head = new ArrayLLN<T>(stuff, head); // insert at head, with head as next pointer
+        else if (pos > 0 && pos < length()) { // if inserting not at the head or tail
+            ArrayLLN<T> *P = head, *Q = nullptr;
+            for (int i = 0; i < pos; i++, Q = P, P = P->getnext());
+            if (Q) Q->setnext(new ArrayLLN<T>(stuff, P));
+            else P->setnext(new ArrayLLN<T>(stuff, P->getnext()));
+        } else if (pos == length()) // if inserting at the tail.
+            if (head == NULL) head = new ArrayLLN<T>(stuff, NULL);
+            else head->addback(stuff);
+        else return;
+    }
 
 };
 
diff --git a/PG5/ArrayLLN.h b/PG5/ArrayLLN.h
index 8be4726..a84dbf7 100644
--- a/PG5/ArrayLLN.h
+++ b/PG5/ArrayLLN.h
@@ -9,38 +9,43 @@
 #include <cstdlib>
 #include "PG5.h"
 #include "ArrayLL.h"
+
 using namespace std;
 
-template <class T> class ArrayLL;
+template<class T>
+class ArrayLL;
 
-template <class T> class ArrayLLN{
+template<class T>
+class ArrayLLN {
 private:
-	T contents;
-	ArrayLLN<T> *next;
+    T contents;
+    ArrayLLN<T> *next;
 public:
-	
-	ArrayLLN(T t, ArrayLLN<T>* n){ // Constructor
-		contents = t;
-		next = n;
-	}
-	~ArrayLLN(){delete next;} // Destructor
-	void setcontents(T t){contents = t;} // contents mutator
-	T& getcontents(){return contents;} // contents accessor
-	ArrayLLN<T> * getnext(){return next;} // next ptr accessor
-	void setnext(ArrayLLN<T>* n){next = n;} // next ptr mutator
 
-	void removeself(ArrayLLN<T>* curr, ArrayLLN<T>* prev, ArrayLL<T>* l){ // deletes curr using prev, sets l's head if !prev
-		ArrayLLN<T>*temp = curr->getnext();
-		if (prev) prev->setnext(temp);
-		else l->sethead(temp);
-		curr->setnext(nullptr);
-		delete curr;
-	}
+    ArrayLLN(T t, ArrayLLN<T> *n) { // Constructor
+        contents = t;
+        next = n;
+    }
 
-	void addback(T stuff){ // adds new node at the end of the list.
-		if (!next) next = new ArrayLLN<T>(stuff, nullptr);
-		else next->addback(stuff);
-	}
+    ~ArrayLLN() { delete next; } // Destructor
+    void setcontents(T t) { contents = t; } // contents mutator
+    T &getcontents() { return contents; } // contents accessor
+    ArrayLLN<T> *getnext() { return next; } // next ptr accessor
+    void setnext(ArrayLLN<T> *n) { next = n; } // next ptr mutator
+
+    void
+    removeself(ArrayLLN<T> *curr, ArrayLLN<T> *prev, ArrayLL<T> *l) { // deletes curr using prev, sets l's head if !prev
+        ArrayLLN<T> *temp = curr->getnext();
+        if (prev) prev->setnext(temp);
+        else l->sethead(temp);
+        curr->setnext(nullptr);
+        delete curr;
+    }
+
+    void addback(T stuff) { // adds new node at the end of the list.
+        if (!next) next = new ArrayLLN<T>(stuff, nullptr);
+        else next->addback(stuff);
+    }
 
 };
 
diff --git a/PG5/PG5.cpp b/PG5/PG5.cpp
index ddeb067..a15d199 100644
--- a/PG5/PG5.cpp
+++ b/PG5/PG5.cpp
@@ -4,69 +4,72 @@
 // The ArrayLL template interfaces with the linkedlist as if it were an array.
 
 #include <iostream>
-#include <string>
-#include <cstdlib>
 #include "PG5.h"
 #include "ArrayLL.h"
+
 using namespace std;
 
-int main(int argc, char **argv){ // PG5 main
+int main(int argc, char **argv) { // PG5 main
 
-	string input = "";
-	cout << "cLibrary Version 2.0 -- type help for a list of commands" << endl;
-	ArrayLL<string> list;
+    string input = "";
+    cout << "cLibrary Version 2.0 -- type help for a list of commands" << endl;
+    ArrayLL<string> list;
 
-	while (converttolower(input).substr(0, 4) != "exit"){ // quit program when exit command is found
+    while (converttolower(input).substr(0, 4) != "exit") { // quit program when exit command is found
 
-		cout << "Enter command: ";
-		getline(cin, input);
-		string lower = converttolower(input);
+        cout << "Enter command: ";
+        getline(cin, input);
+        string lower = converttolower(input);
 
-		if (lower.substr(0, 3) == "add"){ // insert a new node in alphabetical order, not allowing duplicates (case-insensitive)
+        if (lower.substr(0, 3) ==
+            "add") { // insert a new node in alphabetical order, not allowing duplicates (case-insensitive)
 
-			bool found = false;
-			string linputstr = converttolower(input.substr(5, input.length() - 6));
+            bool found = false;
+            string linputstr = converttolower(input.substr(5, input.length() - 6));
 
-			for (int i = 0; i < list.length(); i++) // Make sure no duplicates are entered
-				if (converttolower(list[i]) == linputstr)
-					found = true;
+            for (int i = 0; i < list.length(); i++) // Make sure no duplicates are entered
+                if (converttolower(list[i]) == linputstr)
+                    found = true;
 
-			int j = 0;
-			for (j = 0; j < list.length(); j++) // Find where in the list that it needs to be inserted
-				if (converttolower(list[j]) > linputstr)
-					break;
-			
-			if (!found) list.insert(j, input.substr(5, input.length() - 6));
+            int j = 0;
+            for (j = 0; j < list.length(); j++) // Find where in the list that it needs to be inserted
+                if (converttolower(list[j]) > linputstr)
+                    break;
 
-		}
-		
-		if (lower.substr(0, 5) == "print"){ // prints the entire list, which should be in alphabetical order
-			cout << endl;
-			for (int i = 0; i < list.length(); i++)
-				cout << list[i] << endl;
-			cout << endl << "There are " << list.length() << " titles in the library." << endl;
-		}
+            if (!found) list.insert(j, input.substr(5, input.length() - 6));
 
-		if (lower.substr(0, 6) == "remove"){ // removes all the items in the library that contain search string 
-			string lv = lower.substr(8, input.length() - 9);
-			for (int i = 0; i < list.length(); i++){
-				string ll = converttolower(list[i]);
-				if (ll.find(lv) >= 0 && ll.find(lv) < ll.length()){
-					cout << "\"" << list.remove(i) << "\"" << " was removed from the library." << endl;
-					i--;
-				}
-			}
-		}
-		
-		if (lower.substr(0, 4) == "help" || lower.substr(0, 4) == "halp"){ // prints info for each function
-			cout << endl << "These are the commands that this program accepts: " << endl << endl;
-			cout << "add \"book title\" \t--adds a new entry with book title as the name" << endl;
-			cout << "remove \"search term\" \t--deletes all books that contain search term" << endl;
-			cout << "print \t\t\t--prints out the entire library in alphabetical order" << endl;
-			cout << "exit \t\t\t--exits the program (also clears the library)" << endl << endl;
-		}
-	}
-	return 0;
+        }
+
+        if (lower.substr(0, 5) == "print") { // prints the entire list, which should be in alphabetical order
+            cout << endl;
+            for (int i = 0; i < list.length(); i++)
+                cout << list[i] << endl;
+            cout << endl << "There are " << list.length() << " titles in the library." << endl;
+        }
+
+        if (lower.substr(0, 6) == "remove") { // removes all the items in the library that contain search string
+            string lv = lower.substr(8, input.length() - 9);
+            for (int i = 0; i < list.length(); i++) {
+                string ll = converttolower(list[i]);
+                if (ll.find(lv) >= 0 && ll.find(lv) < ll.length()) {
+                    cout << "\"" << list.remove(i) << "\"" << " was removed from the library." << endl;
+                    i--;
+                }
+            }
+        }
+
+        if (lower.substr(0, 4) == "help" || lower.substr(0, 4) == "halp") { // prints info for each function
+            cout << endl << "These are the commands that this program accepts: " << endl << endl;
+            cout << "add \"book title\" \t--adds a new entry with book title as the name" << endl;
+            cout << "remove \"search term\" \t--deletes all books that contain search term" << endl;
+            cout << "print \t\t\t--prints out the entire library in alphabetical order" << endl;
+            cout << "exit \t\t\t--exits the program (also clears the library)" << endl << endl;
+        }
+    }
+    return 0;
 }
 
-string converttolower(string s){for (unsigned int i = 0; i < s.length(); i++) s[i] = tolower(s[i]); return s;}
+string converttolower(string s) {
+    for (unsigned int i = 0; i < s.length(); i++) s[i] = tolower(s[i]);
+    return s;
+}
diff --git a/PG5/PG5.h b/PG5/PG5.h
index d8fcc7e..e3aef07 100644
--- a/PG5/PG5.h
+++ b/PG5/PG5.h
@@ -8,6 +8,7 @@
 #include<string>
 #include<cstdlib>
 #include "ArrayLL.h"
+
 using namespace std;
 
 int main(int argc, char **argv); // Main...
diff --git a/PG6/PG6.cpp b/PG6/PG6.cpp
index b642ea2..4678e1b 100644
--- a/PG6/PG6.cpp
+++ b/PG6/PG6.cpp
@@ -3,57 +3,56 @@
 // This program reads a file, uses the first four bytes as an integer record size and sorts the rest of the file in recordsz chunks.
 
 #include <iostream>
-#include <string>
 #include <cstdlib>
-#include <algorithm>
 #include <fstream>
 #include "PG6.h"
+
 using namespace std;
 
-int main(int argc, char **argv){ 
-	string fn = "";
-	streampos fsz;
-	cout << "Enter the name of the file that you want to sort." << endl << "File Name: ";
-	getline(cin, fn); // Get file name from user
-	fstream f (fn, ios::in | ios::out | ios::binary); // Open file from input location for read and write and as binary
-	if (f.is_open()){
+int main(int argc, char **argv) {
+    string fn = "";
+    streampos fsz;
+    cout << "Enter the name of the file that you want to sort." << endl << "File Name: ";
+    getline(cin, fn); // Get file name from user
+    fstream f(fn, ios::in | ios::out | ios::binary); // Open file from input location for read and write and as binary
+    if (f.is_open()) {
 
-		char * recordsz = new char[4];
-		f.read(recordsz, (streamsize) 4); // Read first four bytes
-		int rsz = atoi(recordsz); // Store first four bytes as int record size
-		f.seekg(0, f.end);
-		fsz = f.tellg(); // Get length of file
-		int recordcnt = ((int)fsz-4) / rsz; // Get # of records 
-		f.seekg(0, f.beg);
-		
-		// Begin shell sort
-		int d = recordcnt;
-		while (d > 1){
-			d = (d == 2) ? 1 : d % 2 == 1 ? (d + 1) / 2 : d % 4 == 0 ? d / 2 + 1 : d / 2 + 2;
-			for (int i = d; i < recordcnt; i++) // Use readstring and writestring methods to get and put strings in the file
-				for (int j = i - d; j >= 0 && readstring(f,j,rsz) > readstring(f,j + d,rsz); j -= d){
-				string t = readstring(f,j,rsz);
-				writestring(f, j, rsz, readstring(f,j + d,rsz));
-				writestring(f, j+d, rsz, t);
-				}
-		}
-		cout << "Sort successful." << endl;
-		f.close();
-	}
-	else cout << "Error: file could not be opened or does not exist." << endl;
-	system("pause");
+        char *recordsz = new char[4];
+        f.read(recordsz, (streamsize) 4); // Read first four bytes
+        int rsz = atoi(recordsz); // Store first four bytes as int record size
+        f.seekg(0, f.end);
+        fsz = f.tellg(); // Get length of file
+        int recordcnt = ((int) fsz - 4) / rsz; // Get # of records
+        f.seekg(0, f.beg);
+
+        // Begin shell sort
+        int d = recordcnt;
+        while (d > 1) {
+            d = (d == 2) ? 1 : d % 2 == 1 ? (d + 1) / 2 : d % 4 == 0 ? d / 2 + 1 : d / 2 + 2;
+            for (int i = d;
+                 i < recordcnt; i++) // Use readstring and writestring methods to get and put strings in the file
+                for (int j = i - d; j >= 0 && readstring(f, j, rsz) > readstring(f, j + d, rsz); j -= d) {
+                    string t = readstring(f, j, rsz);
+                    writestring(f, j, rsz, readstring(f, j + d, rsz));
+                    writestring(f, j + d, rsz, t);
+                }
+        }
+        cout << "Sort successful." << endl;
+        f.close();
+    } else cout << "Error: file could not be opened or does not exist." << endl;
 }
 
-string readstring(fstream &f, int recordpos, int len){ // This method seeks to the position of recordpos * len, reads len bytes and returns that string
-	char* t = new char[len];
-	f.seekg(recordpos*len + 4, ios::beg);
-	f.read(t, len);
-	return (string)t;
+string readstring(fstream &f, int recordpos,
+                  int len) { // This method seeks to the position of recordpos * len, reads len bytes and returns that string
+    char *t = new char[len];
+    f.seekg(recordpos * len + 4, ios::beg);
+    f.read(t, len);
+    return (string) t;
 }
 
-void writestring(fstream &f, int recordpos, int len, string s){ // Writes string s to f at position recordpos*len
-	f.seekp(recordpos*len + 4, ios::beg);
-	char * t = new char[s.length()];
-	for (unsigned int i = 0; i < s.length(); i++) t[i] = s[i];
-	f.write(t, len);
+void writestring(fstream &f, int recordpos, int len, string s) { // Writes string s to f at position recordpos*len
+    f.seekp(recordpos * len + 4, ios::beg);
+    char *t = new char[s.length()];
+    for (unsigned int i = 0; i < s.length(); i++) t[i] = s[i];
+    f.write(t, len);
 }
diff --git a/PG6/PG6.h b/PG6/PG6.h
index 809c3d1..866b21b 100644
--- a/PG6/PG6.h
+++ b/PG6/PG6.h
@@ -9,10 +9,13 @@
 #include <string>
 #include <cstdlib>
 #include <fstream>
+
 using namespace std;
 
 int main(int argc, char **argv);
+
 string readstring(fstream &f, int recordpos, int len);
+
 void writestring(fstream &f, int recordpos, int len, string s);
 
 #endif