Updated comments and made sure style was consistent

Headers/Problem26.hpp

@@ -1,11 +1,11 @@
-//ProjectEuler/C++/Headers/Problem26.hpp
+//ProjectEuler/ProjectEulerCPP/Headers/Problem26.hpp
 //Matthew Ellison
 // Created: 07-28-19
-//Modified: 07-28-19
+//Modified: 07-09-20
 //Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
 //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
@@ -32,14 +32,20 @@
 
 class Problem26 : public Problem{
 private:
+	//Variables
+	//Static variables
 	static unsigned int TOP_NUMBER;	//Holds the highest denominator we will check
+	//Instance variables
 	unsigned int longestCycle;	//The length of the longest cycle
 	unsigned int longestNumber;	//The starting denominator of the longest cycle
 public:
+	//Constructor
 	Problem26();
-	virtual void solve();
-	virtual std::string getString() const;
-	virtual void reset();
+	//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
 	unsigned int getLongestCycle() const;	//Returns the length of the longest cycle
 	unsigned int getLongestNumber() const;	//Returns the denominator that starts the longest cycle
 };
@@ -48,7 +54,7 @@ public:
 /* Results:
 The longest cycle is 982 digits long
 It is started with the number 983
-It took 6.865 milliseconds to solve this problem.
+It took an average of 9.989 milliseconds to run this problem over 100 iterations
 */
 
 #endif //PROBLEM26_HPP