La Fée Verte @Absinthe@qoto.org
The green faerie
Joined Aug 2019
La Fée Verte
boosted
@Absinthe
#toyprogrammingchallenge
I wrote a Life in JavaScript a few years ago. I suppose I could interpret the challenge as building the smallest one I can, but I've done enough of them that one more isn't interesting at present. I suppose I should do it in Elm, but I'm having too much fun programming MIDI in Lisp right now.
https://billstclair.com/life
#toyprogrammingchallenge
I wrote a Life in JavaScript a few years ago. I suppose I could interpret the challenge as building the smallest one I can, but I've done enough of them that one more isn't interesting at present. I suppose I should do it in Elm, but I'm having too much fun programming MIDI in Lisp right now.
https://billstclair.com/life
Okay, here is one before the weekend.
Conway's Game of Life. It is a simple concept. Set up some cool patterns and let it run on a good cycle. I just did it, using '*' and ' ' but feel free to do it graphically if you prefer. Here are the rules, and my code is in the same repo so let that be a spoiler warning:
https://git.qoto.org/Absinthe/life-conway/blob/master/README.md
@JJFlash Well, thanks for following me. I hope you are not disappointed. :) I have not seen it yet, but will look at it this weekend. Thanks.
La Fée Verte
boosted
@Absinthe Hello! I saw you write about programming puzzles (and that's why I followed you), I was wondering if you know Advent of Code, and if you do, how do you like it 🙂
https://www.adventofcode.com
La Fée Verte
boosted
La Fée Verte
boosted
Belatedly, a Balanced Brackets tester, in Python:
https://raw.githubusercontent.com/patchcali/toy-programs-gpl/master/test_brackets_balanced.py
La Fée Verte
boosted
The number and nature of the compromises I have to make when choosing a programming language for every goddamn project really gets to me
La Fée Verte
boosted
Except for C. To every use-case which C is suitable, it has never been a disappointment to me.
why do people mention the presence or lack of eye contact in their cw protected selfies?
@sir There are plenty of them
re: Python Solution
@static thanks?
Python Solution
def snail_sort(matrix):
new_list = []
while matrix:
new_list.extend(matrix.pop(0))
if not matrix:
continue
for i in range(len(matrix)):
new_list.append(matrix[i].pop())
if not matrix:
break
if not matrix:
continue
new_list.extend(reversed(matrix.pop()))
if not matrix:
continue
for i in range(len(matrix) - 1, -1, -1):
new_list.append(matrix[i].pop(0))
if not matrix:
break
return new_list
MATRIX = [
[1, 2, 3, 4, 5],
[16, 17, 18, 19, 6],
[15, 24, 25, 20, 7],
[14, 23, 22, 21, 8],
[13, 12, 11, 10, 9],
]
snail_sort(MATRIX)
La Fée Verte
boosted
I borrowed this one from codewars
Snail Sort
Given an n x n array, return the array elements arranged from outermost elements to the middle element, traveling clockwise.
array = [[1,2,3],
[4,5,6],
[7,8,9]]
snail(array) #=> [1,2,3,6,9,8,7,4,5]
For better understanding, please follow the numbers of the next array consecutively:
array = [[1,2,3],
[8,9,4],
[7,6,5]]
snail(array) #=> [1,2,3,4,5,6,7,8,9]
This image will illustrate things more clearly:
NOTE: The idea is not sort the elements from the lowest value to the highest; the idea is to traverse the 2-d array in a clockwise snailshell pattern.
Octave solution
@khird looks good, much better than my python solution :)
La Fée Verte
boosted
Octave solution
function sorted = snail(array)
if numel(array) <= 1
sorted = array;
else
sorted = [array(1, 1:(end-1)),...
array(1:(end-1), end)',...
array(end, end:-1:2),...
array(end:-1:2, 1)',...
snail(array(2:(end-1), 2:(end-1))) ]; end; end;
La Fée Verte
boosted
For those of you who missed the announcement from the @freemo account just wanted to reiterate it here.
In honor of our new Indian friends we added two new emoji to the server.
Also if anyone has any emoji they want added, even if its just for personal use (like a monogram of your name or a picture of your own face, anything) we can add it. Just send a 50kb or less PNG image to @freemo and it can be added.
I borrowed this one from codewars
Snail Sort
Given an n x n array, return the array elements arranged from outermost elements to the middle element, traveling clockwise.
array = [[1,2,3],
[4,5,6],
[7,8,9]]
snail(array) #=> [1,2,3,6,9,8,7,4,5]
For better understanding, please follow the numbers of the next array consecutively:
array = [[1,2,3],
[8,9,4],
[7,6,5]]
snail(array) #=> [1,2,3,4,5,6,7,8,9]
This image will illustrate things more clearly:
NOTE: The idea is not sort the elements from the lowest value to the highest; the idea is to traverse the 2-d array in a clockwise snailshell pattern.
@citrustwee Dag Eve, well met!
Though my playing is not that great I do make instruments such as cigar box guitars and canjos and the occasional cookie tin guitar. You can see some of them on the my peertube or YouTube let me know if you want a link. I know very little in Dutch, beyond hoe ist
her met je? I can however handle English pretty well :)
