Updated comments and made sure style was consistent

Headers/Problem14.hpp

@@ -1,7 +1,7 @@
-//ProjectEuler/C++/Headers/Problem14.hpp
+//ProjectEuler/ProjectEulerCPP/Headers/Problem14.hpp
 //Matthew Ellison
 // Created: 09-29-18
-//Modified: 07-14-19
+//Modified: 07-09-20
 /*
 The following iterative sequence is defined for the set of positive integers:
 n → n/2 (n is even)
@@ -10,7 +10,7 @@ Which starting number, under one million, produces the longest chain?
 */
 //Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
 /*
-	Copyright (C) 2019  Matthew Ellison
+	Copyright (C) 2020  Matthew Ellison
 
 	This program is free software: you can redistribute it and/or modify
 	it under the terms of the GNU Lesser General Public License as published by
@@ -37,25 +37,30 @@ Which starting number, under one million, produces the longest chain?
 
 class Problem14 : public Problem{
 private:
-	//This function follows the rules of the sequence and returns its length
-	uint64_t checkSeries(uint64_t num);
+	//Variables
+	//Static variables
 	static uint64_t MAX_NUM;	//This is the top number that you will be checking against the series
+	//Instance variables
 	uint64_t maxLength;	//This is the length of the longest chain
 	uint64_t maxNum;	//This is the starting number of the longest chain
+
+	//Function
+	uint64_t checkSeries(uint64_t num);	//This function follows the rules of the sequence and returns its length
 public:
+	//Constructor
 	Problem14();
-	virtual void solve();
-	virtual std::string getString() const;
-	virtual void reset();
-	//Returns the length of the requested chain
-	uint64_t getLength() const;
-	//Returns the starting number of the requested chain
-	uint64_t getStartingNumber() const;
+	//Operational functions
+	virtual void solve();	//Solve the problem
+	virtual void reset();	//Reset the problem so it can be run again
+	//Gets
+	virtual std::string getString() const;	//Return a string with the solution to the problem
+	uint64_t getLength() const;	//Returns the length of the requested chain
+	uint64_t getStartingNumber() const;	//Returns the starting number of the requested chain
 };
 
 /* Results:
 The number 837799 produced a chain of 525 steps
-It took 153.999 milliseconds to solve this problem.
+It took an average of 197.008 milliseconds to run this problem over 100 iterations
 */
 
 #endif //PROBLEM14_HPP