Answer by JesterBLUE for Brainfuck Sorting
33 code bytes, 2n+3=11 n+4=8 memory cellsEdited: I can improve memory usage by keeping the count in only one cell.>,[>,]+[<[-<]>[>]>[<-[>]<.>>]<<+]EOF is 0, 8...
View ArticleAnswer by JesterBLUE for Brainfuck Sorting
90 63 bytes code, 769 513 bytes memory>>,[-[[>>]+[<<]>>-]>>[>>]<+<[-<<],]+[[>>]+<[<[<<]>>.>]<[<<]>>+]This works...
View ArticleBrainfuck Sorting
Write a program in brainfuck that accepts input of 4 ASCII characters as numbers (from 32 to 126) and outputs the numbers or ASCII equivalent sorted in ascending order. Requirements: Your program...
View Article
More Pages to Explore .....
