BaseLibraries/OctaveFunctions
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/octavefunctions.git synced 2025-12-07 11:13:57 -05:00
Code Issues Packages Projects Releases Wiki Activity

Added a timer for measuring performance

Browse Source
This commit is contained in:
Mattrixwv
2018-09-26 19:16:19 -04:00
parent 1f3df2f1ca
commit 98c47adca6
1 changed files with 7 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
ProjectEuler/Problem4.m
View File

@@ -11,6 +11,7 @@ palindromes = []; %Holds all the numbers that are palindromes
outerCounter = 1; outerCounter = 1;
innerCounter = 1; innerCounter = 1;
startTime = clock(); %This is for timing purposes
while(outerCounter < size(numbers)(2)) 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 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)) while(innerCounter < size(numbers)(2))
@@ -27,6 +28,8 @@ while(outerCounter < size(numbers)(2))
end end
++outerCounter; %Increment ++outerCounter; %Increment
end end
endTime = clock(); %This is for timing purposes
timeTaken = etime(endTime - startTime) %This is for timing purposes
max(palindromes) max(palindromes)
@@ -36,6 +39,10 @@ clear innerCounter;
clear answer; clear answer;
clear numbers; clear numbers;
clear palindromes; clear palindromes;
clear startTime;
clear endTime;
clear timeTaken;
%This way is slow. I would like to find a faster way %This way is slow. I would like to find a faster way
%{ %{