Comments for Elvis Montero http://www.elvismontero.com Technologist. Blogger. Human. Mon, 20 Jun 2011 23:55:38 +0000 hourly 1 http://wordpress.org/?v=3.1.3 Comment on King Crab by Alejandro http://www.elvismontero.com/2011/06/19/king-crab/comment-page-1/#comment-38139 Alejandro Mon, 20 Jun 2011 23:55:38 +0000 http://www.elvismontero.com/?p=983#comment-38139 nice shot! I would have lend you my macro... xD nice shot! I would have lend you my macro… xD

]]> Comment on King Crab by emontero http://www.elvismontero.com/2011/06/19/king-crab/comment-page-1/#comment-38082 emontero Mon, 20 Jun 2011 01:49:29 +0000 http://www.elvismontero.com/?p=983#comment-38082 My crab is cooler than Sony's, right? :D My crab is cooler than Sony’s, right? :D

]]> Comment on King Crab by Ivan http://www.elvismontero.com/2011/06/19/king-crab/comment-page-1/#comment-38076 Ivan Sun, 19 Jun 2011 23:43:42 +0000 http://www.elvismontero.com/?p=983#comment-38076 Cool, a giant enemy crab :) http://www.youtube.com/watch?v=IH2w2l1JTs4 Cool, a giant enemy crab :) http://www.youtube.com/watch?v=IH2w2l1JTs4

]]> Comment on Lowest Common Ancestor by emontero http://www.elvismontero.com/2011/03/21/lowest-common-ancestor/comment-page-1/#comment-35695 emontero Wed, 27 Apr 2011 03:32:33 +0000 http://www.elvismontero.com/?p=909#comment-35695 Since I'm loading the entire tree in memory, the running time is DFS's worst case performance -- i.e. <strong>O( | V | + | E | )</strong>. Namely, the more vertices and corresponding relationships in your tree, the more time this algorithm will take to finish (the same principle applies to the space complexity of this approach). I decided to use DFS because I visualized the problem as recursive in nature. You could still use BFS if you're so inclined though. Of course, you'd have to use a <strong>queue</strong> instead of the implicit stack I'm using here. Time and space complexities would stay the same. Since I’m loading the entire tree in memory, the running time is DFS’s worst case performance — i.e. O( | V | + | E | ). Namely, the more vertices and corresponding relationships in your tree, the more time this algorithm will take to finish (the same principle applies to the space complexity of this approach).

I decided to use DFS because I visualized the problem as recursive in nature. You could still use BFS if you’re so inclined though. Of course, you’d have to use a queue instead of the implicit stack I’m using here. Time and space complexities would stay the same.

]]> Comment on Locked by Elvis Montero http://www.elvismontero.com/2011/02/11/locked/comment-page-1/#comment-35503 Elvis Montero Fri, 22 Apr 2011 21:01:29 +0000 http://www.elvismontero.com/?p=885#comment-35503 Mi hijo, le decía precisamente anoche a algunos de tus hermanos, que eras el único de Uds. que de manera espontanea había ido a El Cercado. La foto, muestra mucho de lo que abunda en nuestros campos y pueblos, pero te aseguro, que a pesar de la abrumadora abundancia de imágenes como la que muestras se requiere de una sensibilidad especial para observarlas y fotografiarlas. Eres un ser especial. Tu Papa Mi hijo, le decía precisamente anoche a algunos de tus hermanos, que eras el único de Uds. que de manera espontanea había ido a El Cercado.
La foto, muestra mucho de lo que abunda en nuestros campos y pueblos, pero te aseguro, que a pesar de la abrumadora abundancia de imágenes como la que muestras se requiere de una sensibilidad especial para observarlas y fotografiarlas. Eres un ser especial.
Tu Papa

]]>