#Perl, 52 bytes
Perl, 52 bytes
-13 byte thanks to @manatwork
-1 byte thanks to @msh210
sub f{lc pop=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 52 bytes
-13 byte thanks to @manatwork
-1 byte thanks to @msh210
sub f{lc pop=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
Perl, 52 bytes
-13 byte thanks to @manatwork
-1 byte thanks to @msh210
sub f{lc pop=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 5352 bytes
-13 byte thanks to @manatwork
-1 byte thanks to @msh210
sub f{lc$_[0]=~slc pop=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 53 bytes
-13 byte thanks to @manatwork
sub f{lc$_[0]=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 52 bytes
-13 byte thanks to @manatwork
-1 byte thanks to @msh210
sub f{lc pop=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 53 bytes
-13 byte thanks to @manatwork
sub f{lc$_[0]=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band perlper line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 53 bytes
-13 byte thanks to @manatwork
sub f{lc$_[0]=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band perl line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .
#Perl, 53 bytes
-13 byte thanks to @manatwork
sub f{lc$_[0]=~s/^the //ri}print sort{f($a)cmp f$b}<>
One band per line as input, and so is the output.
The implementation is quite straight forward : the program prints the list of bands, sorted with the help of a custom function (f) which returns the lower case band name without the eventual leading the .