bodom_lx blog and things|

As I promised, BD-incollo 0.1 is finished and the source code is available in the project page under the GPL 3 license.
Every MUST requirement has been done and just two MAY requirements could not be developed in just 6 days. But They will surely be in the next releases.
Sourcecode is well commented using xP standards and there are few comments where necessary, but is should be clear. If not, drop me a mail.
I will write a map that describes the source code tree tomorrow!
The conclusions of this experiment are that Django is really a web framework for perfectionists with deadlines! I spent more time playing with templates and CSS than with the whole python coding! It's a valid alternative to Ruby on Rails, and built on a programming language I really like.
Go and grab the code!

Just released the code for the 0.9 version. Changes from the experiments of 0.8 are listed on the project page, but the most important ones are that the theme is now fully compatible with

• Internet Explorer 7 and 8
• Mozilla Firefox 2
• Mozilla Firefox 3
• Google Chrome
• Apple Safari

And there are lots of visual improvements, too. Go to see them on the project page, and grab the code, too!
Obviously, coding for the 1.0 release has just started, and you will see the changes in the theme applied on my blog.

As I promised more than 2 months ago, I've just released the sourcecode of the wordpress theme on my blog. BD-theme 0.8 is a set of experiments that will bring me to the final release, I cannot promise that it will work perfectly on every browser, but it will almost do the job. Meanwhile, I'm working since 7 days to the next release, 0.9, that should bring to the blog a final layout.
UPDATE 2008-08-22: The theme you're actually seeing in the blog is what will become BD-theme 0.9. I'm testing it.

As you see, the blog has a brand new theme! the blog's theme has got a new, fresh look! I decided to bring some new improvements and a change in the layout. Let me experiment with it, fix some bugs and then I will release the source code, as always

I'm pleased to publish this insertion sort implementation on single linked lists developed with my collegue Rigel.
It's a nice experiment in asymptotic complexity of O(n^3). The high complexity is due to the necessity of retrieving the neighbours of the node handled, a difficult operation when using single linked lists.

Download: Insertion Sort on Single Linked Lists