51 lines
1.4 KiB
Plaintext
51 lines
1.4 KiB
Plaintext
|
---
|
||
|
title: My first post and introduction
|
||
|
author: Suguivy
|
||
|
---
|
||
|
|
||
|
Hello internet!
|
||
|
|
||
|
I will start my first post talking **my adventures in the computing world**
|
||
|
and **what I will post here**.
|
||
|
|
||
|
## My adventures
|
||
|
|
||
|
I have been always interested in computers and computer science, and that
|
||
|
field is one of my main motivations in my life.
|
||
|
|
||
|
### How I started
|
||
|
|
||
|
I started to programming at 18 years old, when I could have my first decent
|
||
|
computer, and started to make small videogames with *Lua*.
|
||
|
|
||
|
One year after I have started to open more in this world, programming in
|
||
|
*C* and *C++* and programming other type of things.
|
||
|
|
||
|
Later I read more than a half of the [SICP]() book. Is a fantastic book with
|
||
|
which I learned a lot of fantastic stuff:
|
||
|
|
||
|
- Functional programming.
|
||
|
- *Scheme*, a lisp dialect and a beautiful language.
|
||
|
- Recursivity in depth.
|
||
|
- ...
|
||
|
|
||
|
### Moving towards Haskell and functional programming
|
||
|
|
||
|
Months after that, I became interested in *Haskell*. It impressed me
|
||
|
because is a language with a beautiful syntax and ver expressive. Here
|
||
|
an example of the [quicksort]() algorithm:
|
||
|
|
||
|
```haskell
|
||
|
quicksort :: Ord a => [a] -> [a]
|
||
|
quicksort [] = []
|
||
|
quicksort (p:xs) = (quicksort lesser) ++ [p] ++ (quicksort greater)
|
||
|
where
|
||
|
lesser = filter (< p) xs
|
||
|
greater = filter (>= p) xs
|
||
|
```
|
||
|
|
||
|
I started to learn it slowly, and nowadays I'm still learning some things.
|
||
|
|
||
|
### Meeting Rust and Python
|
||
|
WIP
|