I have made some progress... I have found a few formulas that work for certain things but it is yet to be complete.
I have made some progress... I have found a few formulas that work for certain things but it is yet to be complete.
"without goto we would be wtf'd"
just a thought...
pseudo:
Code:t1 = currentTime; t2 = otherTime; p1 = currentPass; p2 = otherPass; if ( (t1 % 2) != 0 ) { t2 = ( (t1+1) / 2 ) ; p2 = ( p1 / 2 ) ; };
"without goto we would be wtf'd"
Attachment 15960
I have developed a much more efficient algorithm for this particular case. The original one was very slow to calculate all passwords for a given range (needed to validate solution). Although it increases in time consumed as the time increments, it is much more capable of getting passwords much faster leaving out the calc of endless dots (lol). The original one took the same amount of time on the first time as the last time. You can see the difference in the white space below. It uses recursion as well rather than loops.
for this particular case
Last edited by Structure; 01-26-2020 at 11:45 AM.
"without goto we would be wtf'd"