Divide by zer0: 2013

I'm here!

Sorry for not posting lately, I've been quite busy (and also I forgot about this blog), but I haven't been losing time, I've researched a little and I have found a lot of topics which I will dive into deeper during holidays. This topics are:

Reverse engineering
C and ASM programming
Chess
Drawing
Playing the guitar

And a lot of other things. Hopefully I'll be updating this blog more often.
Until next post!

Twitter style

Just a little code I wrote to change twitter a little. I'll keep making some changes I suppose
Preview:

Code: You might also want to chek this: http://userstyles.org/styles/76627/twitter-circle-avatar, circular avatars are the shit :P

This is what my days are pretty much made of

Secuencia de Collatz (recursiva)

Quizás lo mejores después, por ahora lo dejo recursivo.

Importance of algorithms

Code without Miller-Rabin implementation: Estimated time to calculate perfect number with p = 31: > 10 min.

Code With Miller-Rabin implementation: Estimated time to calculate perfect number with p = 31: ~ 1 sec.
Implementation gotten from here.

Números triangluares

Easy, right? :D

25-02-2013

Samsung Galaxy Ace
Background: Fall by itnsltwn
GO Launcher Theme: Minimal Windows7
Clock: SiMi Clock Pro v2.5.3 Font: ProFont

Don't be that guy...

[Python] Anagrams or not

 lista1 = [];lista2 = []  
 palabra1 = raw_input("Primer string: ")  
 palabra2 = raw_input("Segundo string: ")  
 palabra1.lower();palabra2.lower()  
 for i in palabra1:  
      lista1.append(i)  
 for n in palabra2:  
      lista2.append(n)  
 lista1.sort();lista2.sort()  
 if lista1 == lista2:  
      print "\nThey're anagrams"  
 else:  
      print "\nThey're not anagrams"

Estaba leyendo un libro de algoritmos en python y al final del primer capítulo ponía como ejercicio hacer un script que detecte si dos cadenas son anagramas. Esto fue lo primero que se me ocurrió, si conocen una forma más simple de hacerlo, agradeceria que lo comenten :)

Divide by zer0