Gabriel Saldaña's blog

personal blog, photography and programming

Tag: dance (page 1 of 2)

Ballet Class

A few months ago I attended the open ballet class of cuban teacher Chery, a legend in the cuban school of ballet. It was interesting to watch her way of teaching and correcting students. Also I admire her passion and energy of still touring the world to give lectures and workshops at her age. I […]

Nutcracker rehearsals by the Academia de la Danza Mexicana

Photographing dance is a tough task. Specially when it is an indoor low budget theatre with poor lighting setup. In these situations, you push your gear to the limit, not because you set the gear to the its maximum settings but because you need to explore the limits between capturing the moment and haivng a […]

Danza UNAM 10 year anniversary

The UNAM has a dance division, that is not exaclty a school for professional dancers, but promotes events, creates workshops, connects dancers and provides spaces for their works. To celebrate their 10 year anniversary, they organized a mass dance event open to the public. It took place outside the MUAC museum and it had one […]

Theatre and Dance

Back in September I took some photos of this very creative outdoor theatre and dance at the UNAM. People were walking around the green areas and fountains of the University campus, and suddenly musicians and dancers start their act among them. They gathered the crowd to the stairs of one of the theatres and they […]

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: […]

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 […]

Older posts