I found your implementation very curious. At fist, it looks like: "why would I want to do this?", but then...
I work a lot with Numpy, but somehow within I feel there will be a place for an implementation like this in my projects.
How large are the lists you have worked with? Do you have any experience in performance? More than 2 dimensions? :-) as you can see, I am a very curious person.
I am having quite busy days, but asap I have some spare time I will have a close look also.
Great idea!
The full name is: ACM ICPC
It stands for: Association for Computing Machinery - International Collegiate Programming Contest
You can read more at:
en.wikipedia.org/wiki/Internationa...
I only participated in the local one, I didn't qualify to the international
Thanks!
Thanks so much for explaining me.
I found your implementation very curious. At fist, it looks like: "why would I want to do this?", but then...
I work a lot with Numpy, but somehow within I feel there will be a place for an implementation like this in my projects.
How large are the lists you have worked with? Do you have any experience in performance? More than 2 dimensions? :-) as you can see, I am a very curious person.
I am having quite busy days, but asap I have some spare time I will have a close look also.
Cheers,
Unfortunately, I don't quite remember, but most of the problems I solve have the following properties:
1) Running time = 2 seconds
2) Size of the list = 10e5 or 10e6
Those numbers are approximations, not exact!
I usually use lists with no more than two dimensions
Hope that helps!
That helps a lot.
I will let you know if I explore this concept further. I certainly will.
Cheers,
Glad to hear that
Good luck!