Categories
personal

Resolutions for 2014

It’s now February. I know, it’s very late to be writing about resolutions once that a whole month has gone already. Things have been crazy busy the last two months. I’ve been travelling very frequently and having a lot of projects going on so finding some time and mind to update these pages have been […]

Categories
GNU/Linux Free Software & Open Source

How to install Google Music Manager on Debian Wheezy

If you are running Debian Wheezy and have trouble installing the Google Music Manager from the official Google Music downloads page, here’s how you can fix it. The current Google Music Manager depends on libc6 2.15 and Debian Wheezy has libc6 2.13. Changing the libc version is a mayor risk to the stability of your […]

Categories
Photography

A walk through the UNAM Museum of Contemporary Art

On one of my now frequent trips to Mexico city, we went to the MUAC, the state’s university museum of contemporary art, and saw the exhibitions there. I know I’m not a fan of contemporary dance, and after my museum walk through, I discovered I’m also not a fan of contemporary art. I just don’t […]

Categories
personal

Sasha Grey booksigning in Guadalajara

Every year the second biggest book faire in the world takes place in Guadalajara, called International Book Fair, or in spanish “Feria Internacional del Libro”. This year I attended for a couple hours, since my bookshelf has several unread books still, I was not looking to buy any new ones. Sasha Grey, a famous actress, […]

Categories
Programming & Web Development

Select sort algorithm explained with code and dance

Select sort is a very simple algorithm but it’s very inefficient for large lists, but it is good when memory is an issue, since it is an in-place sorting algorithm. Meaning it is an algorithm that doesn’t need to use extra memory to store sorted from unsorted elements. The way it works is the following: […]

Categories
Programming & Web Development

Insert-sort algorithm explained with code and dance

Insert sort is a fast algorithm for small lists. On some languages, insert sort is used to sort small arrays (small sometimes means less than 10) instead of more complex algorithms because it’s fast enough and doesn’t need much memory. To perform Insert-sort: take one element from the list on each iteration, starting from the […]