@Rick I'm not sure what you are doing but O(nlog k) should be possible by keeping a binary tree of pointers to the lists sorted by their first remaining element.
@Rick Not with a comparison sort. There are exactly k^n ways of dividing n elements among k lists, which means you need at least n log2 k bits of information to merge them back again.
(Took me way too long and a wikiwalk into Multinomial theorem to realize this.)
I often see code formatted in an image-like form for obfuscation challenges, such as the IOCCC and Brainfuck programming (like this Conway's game of like program). I was wondering if there was an easy way to do this, or if writing my own program would be a better idea. I found ACME Eyedrops, but ...
Rockstar, 465 bytes
The Ocean takes Someone
The Shark says Shark
The sea was wet
The Song says doo doo doo doo doo doo
While the sea ain't nothing
Shout Someone,The Shark,The Song
Knock the sea down
The End says !
Shout Someone,The Shark,The End
Sweet Child says Baby
My Old Man says Daddy
Litt...
Interesting math theorem courtesy of the internet: let's say that you have an algorithm which is always correct but whose runtime is a random variable. Examples include randomized searching procedures. Since it's possible that this algorithm gets stuck in a dead end due to a bad random seed, once strategy to speed up the algorithm is to periodically restart it with a new random seed.
So the question is: how long should you let it run before restarting it?
Of course, since the answer depends on distribution of runtimes (which depends on both the algorithm and its input), there's no way to ever figure out the ideal length of time to let the algorithm run before restarting it.
However, there is a "universal strategy" which, no matter what the algorithm or input is, results in an expected runtime within a logarithmic factor of the optimal strategy.
And one such optimal strategy is 1,1,2,1,1,2,4,... oeis.org/A182105 where you run the algorithm for 1 time unit, restart, 1 more unit, restart, 2 units, etc.
Background:
There is an integer array given, and we need to find a number of repetition of an integer.
[234, 2, 12, 234, 5, 10, 1000, 2, 99]
This will return 2.
[234, 2, 12, 234]
[2, 12, 234, 5, 10, 1000, 2]
Challenges
1. Input integer array length is 1 < length <= 1,000,000
2. Range of eac...
I often see code formatted in an image-like form for obfuscation challenges, such as the IOCCC and Brainfuck programming (like this Conway's game of like program). I was wondering if there was an easy way to do this, or if writing my own program would be a better idea. I found ACME Eyedrops, but it's for Perl programs. Any help would be appreciated!
Not particularly competitive, but I wrote an Element answer for the first time in a while. What a langauge. https://codegolf.stackexchange.com/a/180322/2867
@ASCII-only Oh yeah I kinda “learned” R a few weeks ago for a statistics side project I was exploring but that was just looking up functions that do what I want, not learning :P
Rockstar, 465 bytes
The Ocean takes Someone
The Shark says Shark
The sea was wet
The Song says doo doo doo doo doo doo
While the sea ain't nothing
Shout Someone,The Shark,The Song
Knock the sea down
The End says !
Shout Someone,The Shark,The End
Sweet Child says Baby
My Old Man says Daddy
Litt...
Background:
There is an integer array given, and we need to find a number of repetition of an integer.
[234, 2, 12, 234, 5, 10, 1000, 2, 99]
This will return 2.
[234, 2, 12, 234]
[2, 12, 234, 5, 10, 1000, 2]
Challenges
1. Input integer array length is 1 < length <= 1,000,000
2. Range of eac...
