Show newer

.... --- .--. . / .. / .-. . -- . -- -... . .-. / -- --- .-. ... .

mental health (kinda negative, same as last time but edited slightly for confidentiality reasons) 

Things I have learned this weekend:

* I am not unlovable
* I am a terrible gf, I'm so sorry love
* I am 100% polyamorous
* I am gay as heck
* My mental health is way worse than I think it is, and I need serious help

@Efi *puts her hand into your mouth while it's still open, then waits for you to bite down*

mergesort in haskell 

merge xs [] = xs
merge [] ys = ys
merge (x:xs) (y:ys) = if x <= y
then x : (merge xs (y:ys))
else y : (merge (x:xs) ys)

mergesort [] = []
mergesort [x] = [x]
mergesort list = merge first_half second_half
where
(first, second) = splitAt (length list `div` 2) list
first_half = mergesort first
second_half = mergesort second

I wanna write a short haskell program, and try and fit it in a single toot. any ideas?

Show older
Computer Fairies

Computer Fairies is a Mastodon instance that aims to be as queer, friendly and furry as possible. We welcome all kinds of computer fairies!