Input : Number - (zero bound) example 5, 51
Output : String - example (for the input 5) F, (for the input 51) AZ
Quite rightly so BigHappyDaddy! I'll have to blame Paul (the OP) for thinking 0 is AvbaInet,
Yes, the character sequence for 256 is IV in Excel, but it was implied in the original post that A = 0.![]()
We'll need BlueIshDan to write a working function because 99999 isn't FRYD, it's EQXD (0 = A) or EQXC (1 = A).Someone could always volunteer to do a semi-scientific experiment. Wrap a timer around a numerical sequence loop of several thousand(?) numbers and call the function for number. Then compare times???
I'm not talking in terms of hexavigesimal and I'm sure neither is Paul.
Probably my nerdy way of adding complexity to the issueI'll have to blame Paul (the OP) for thinking 0 is A![]()
I'm now going to rank all the nerds on this project:Probably my nerdy way of adding complexity to the issue![]()
A loop would be less expensive than recursion but in this case it's very negligible. We're working with native data types, no other classes or functions involved and just one IF...END IF block. The whole concept of recursion is to take the tedium out of having to write a bunch of IFs and nested FORs. Think about trying to traverse a tree with 50 nodes and each node has other 50 nodes and so on.I'm also still questioning the performance of a function that is called repeatedly for the same result as a function hat is called once. The reinitializing of variables and I'm sure the processing of jumping between the scope of which is calling the function and the function itself is not worth doing. I don't know why but I've always had a problem with this lol. That goes to say the QSort has always bugged the crap out of me too!![]()
If there are less of the files that you don't need in the folder then copy the folder and delete the ones you don't need. It might just be quicker than moving individual files. Also try the FileScriptingObject for copying/moving files/folders.Example for me is when doing a batch file that has to copy a bunch of files from one directory to another. Writing the xcopy command for each file you want to copy causes the process to slow down because it has to initialize the command and dump it for each file. But if you create mock (empty files with same name) and simply have one xcopy command that copies all files from one directory to another where they exist. The process runs extremely faster.
Thoughts or guidance on how I should think about this?
(Decimal) Base-10: 99999
To base-26
Alpha: True
-------------------------------------
(0) : 99999 Mod 26
(0) = 3
(99999 / 26 : 3846)
(1) : 3846 Mod 26
(1) = 24
(3846 / 26 : 147)
(2) : 147 Mod 26
(2) = 17
(147 / 26 : 5)
(3) : 5 Mod 26
(3) = 5
(5 / 26 : 0)
(3) 5 = F
(2) 17 = R
(1) 24 = Y
(0) 3 = D
If only pr2-eugin had made his base 1 BlueIshDan would have had less to worry about.So what is the value after "Z". In this case the answer is "AA". But A = 0, so this is two zeros for each significant digit. The value after "Z" in a hexavigesimal sequence would be to add a significant digit with the first non-zero value (B), followed by a zero (A). So, BA follows Z. And really Z is actually "AZ", we just assume nothing is zero, but again, in this case A=0.