From 98c47adca64acaa8ec6c3a6d25f6ba651bde6055 Mon Sep 17 00:00:00 2001
From: Mattrixwv <m_ellison@ymail.com>
Date: Wed, 26 Sep 2018 19:16:19 -0400
Subject: [PATCH] Added a timer for measuring performance

---
 ProjectEuler/Problem4.m | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/ProjectEuler/Problem4.m b/ProjectEuler/Problem4.m
index 88cc081..b615116 100644
--- a/ProjectEuler/Problem4.m
+++ b/ProjectEuler/Problem4.m
@@ -11,6 +11,7 @@ palindromes = [];	%Holds all the numbers that are palindromes
 outerCounter = 1;
 innerCounter = 1;
 
+startTime = clock();	%This is for timing purposes
 while(outerCounter < size(numbers)(2))
 	innerCounter = outerCounter;	%Once you have multiplied 2 numbers there is no need to multiply them again, so skip what has already been done
 	while(innerCounter < size(numbers)(2))
@@ -27,6 +28,8 @@ while(outerCounter < size(numbers)(2))
 	end
 	++outerCounter;	%Increment
 end
+endTime = clock();	%This is for timing purposes
+timeTaken = etime(endTime - startTime)	%This is for timing purposes
 
 max(palindromes)
 
@@ -36,6 +39,10 @@ clear innerCounter;
 clear answer;
 clear numbers;
 clear palindromes;
+clear startTime;
+clear endTime;
+clear timeTaken;
+
 
 %This way is slow. I would like to find a faster way
 %{