Numeric to Alphabetic Organization

Question

I have a list of images grouped numerically (YI0.png, YI1.png...YI20479.png). I want them sorted alphabetically, like so:

YI0.png -> YIA.png
YI1.png -> YIAA.png

without my last image having 20479 As in it.

Input

A directory name.

Output

All files in that directory will be alphabetically renamed.

Constraints

• The pattern is always Prefix Number.Extension
• There are no subdirectories
• All files in the directory adhere to the pattern
• Number starts at 0
• Prefix doesn't contain numbers

Example

Directory consisting of Pie0.txt, Pie1.txt, all the way to Pie11.txt would be renamed to PieA.txt, PieB.txt, all the way to PieL.txt.

If it goes to Pie28.txt, they would be renamed like so:

Pie0.txt -> PieA.txt
Pie1.txt -> PieAA.txt
Pie2.txt -> PieAB.txt
Pie3.txt -> PieB.txt
Pie28.txt -> PieZ.txt

Remember, this is code-golf, so the answer in the shortest bytes wins.

Answer 1

Perl, 65 bytes

Assumes the number sequence starts with 0 and has no holes (or duplicates if there are extra leading zeros). No error checking. Assumes only plain files, filenames do not start with . and the user can enter the directory.

Run with the directory as argument

alphaorg.pl directory

alphaorg.pl:

#!/usr/bin/perl
chdir pop;$a=A;@F=sort map$a++,<*>;rename$_,s/\d+/$F[$&]/r for<*>

If the directory name can't contain digits and your sytem will accept / as directory separator (unix and windows do), this 61 byte version is shorter (give directory name on STDIN here):

#!/usr/bin/perl -ln
$a=A;@F=sort map$a++,@;=<$_/*>;rename$_,s/\d+/$F[$&]/r for@

Answer 2

Haskell - 97 bytes

I probably picked the wrong language; Haskell has painfully long names for IO operations

r p=do f<-getDirectoryContents p;sequence_.zipWith renameFile(sort f).sort$permutations['A'..'Z']

(this program has O(26^26) in run-time unless you're on a quantum computer)