Updated comments and made sure style was consistent

Headers/Problem23.hpp

@@ -1,11 +1,11 @@
-//ProjectEuler/C++/Headers/Problem23.hpp
+//ProjectEuler/ProjectEulerCPP/Headers/Problem23.hpp
 //Matthew Ellison
 // Created: 11-09-18
-//Modified: 07-14-19
+//Modified: 07-09-20
 //Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers
 //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
@@ -33,24 +33,30 @@
 
 class Problem23 : public Problem{
 private:
-	static int MAX_NUM;
+	//Variable
+	//Static variables
+	static int MAX_NUM;	//The largest possible number that can not be written as the sum of two abundant numbers
+	//Instance variables
 	std::vector<uint64_t> divisorSums;	//This gives the sum of the divisors at subscripts
 	uint64_t sum;	//The sum of all the numbers we are looking for
-	//A function that returns true if num can be created by adding two elements from abund and false if it cannot
-	bool isSum(const std::vector<int>& abund, int num);
-	void reserveVectors();
+
+	//Functions
+	bool isSum(const std::vector<int>& abund, int num);	//A function that returns true if num can be created by adding two elements from abund and false if it cannot
+	void reserveVectors();	//Reserve the size of the vector to speed up insertion
 public:
+	//Constructor
 	Problem23();
-	virtual void solve();
-	virtual std::string getString() const;
-	virtual void reset();
-	//Returns the sum of the numbers asked for
-	uint64_t getSum() 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 getSum() const;	//Returns the sum of the numbers asked for
 };
 
 /* Results:
 The answer is 4179871
-It took 4.888 seconds to solve this problem.
+It took an average of 5.902 seconds to run this problem over 100 iterations
 */
 
 #endif //PROBLEM23_HPP