Tagged Questions
6
votes
4answers
597 views
Busy Brain Beaver
Write a brainfuck program of no more than 256 characters that takes as many steps as possible, but does not loop infinitely. The program may not take any input.
More specifically:
Assume an ...
6
votes
4answers
598 views
Fastest Sort in BrainF***
After having implemented QuickSort in BrainF***, I realized it probably wasn't that quick. Operations that are O(1) in normal languages (like array indexing) are significantly longer in BF. Most of ...
16
votes
1answer
1k views
Implement QuickSort in BrainF***
As discussed in the Lounge room on Stack Overflow:
if you can't implement the Quicksort algorithm given en.wikipedia.org/wiki/Quicksort in any language you have minimal knowledge of, you might ...
