Hi Guys
I am re-implementing a perl subroutine in C and this perl-subroutine sorts the key of a hash given to it as input before using it. This hash usually hold about 3000-4000 keys. So I am wondering what to do here:
1) Create another hash in perl-space and sort its keys using the perl sort() function and then pass that hash as input
2) Write my own sort function or, even better, use one from a better source like the Gnu Scientific Library or another third party library.
So, what I am basically asking is if it is worth replaceing perl's sort function with another one in inlined space or not ?
Thanks ! Nitin
