Would it be feasible to calculate directly a k-permutation like k = 10^200000000?
If not, What would be the computational limit to calculate huge k-th permutation in a today computer? How can I estimate it?
Like, what's the biggest k-th permutation that I could calculate in less than a day?
*Note, the permutatio process would be something like this: https://math.stackexchange.com/questions/60742/finding-the-n-th-lexicographic-permutation-of-a-string (if there's a better one, please point me to it)
I will try to clarify. I will generate a file with a really huge number consisting on digits filling from 200Mb on size storage to absurd numbers like 300000!. (200 x 10^6 digits to 300k! or 1M!)
I want to calculate directly the permutation that that number represents. Is it possible to calculate in few hours? I have an algorithm almost linear time, if needed, for the job I want it to do.
But I read about 9! permutations take 10mins. So probably some permutation on the upper range of this could not be computed in a reasonable time (less than one day). What would be such upper limit, which permutations more than x! could not be directly calculated in my reasonable time? How to estimate this? What can I expect to compute, just the ones up to 10k! 100k! ? 300000!?