14 07 2008

(Dedicated to Kavitha, who has kept on poking me to write a non-technical post)

Perched at queer angle upon your faithful chair.
Working away through the wee hours of the night.
Pumped by the loud stereo music, air guitaring as you see fit.
Taking the lights and sounds for granted.


You hear the faint pitter-patter of the rain.
The hurr of the machine world fades away.
Sounds taken for granted, the background buzz of your life.
The lonely night greets you to partake in its silence.

You can’t make a sound. You can’t strike a match.
You can’t ruin the night.

The window opens, smell the freshness of a rainy night.
That wonderful dusty odour tingles your senses.
You hear that odd dog bark.
You hear that odd truck slosh somewhere in the abyss.

You can’t make a sound. You can’t strike a match.
You can’t ruin the night.

Thoughts flow unbidden into your head.
You can’t filter them, you can’t categorize them.
Mentally, you stand back and watch the chaos of your mind.
occupy this new found vaccum.

You can’t make a sound. You can’t strike a match.
You can’t ruin the night.

The hurr begins again, the lights flash back on.
You are blinded by the light.
The sounds hit you from every side, obtrusive and repulsive.
The night is dead. Long live the night.


anjuta-gvim Preview

11 07 2008

I closed some big bad bugs yesterday, and managed to get a whole workflow (open a bunch of files, edit, save, close) working without any glitchy-ness. Most of the time. And while I’m no where near the quality required to ship this plugin, it feels great all the same.

A phenomenally boring Youtube screencast:

Read the rest of this entry »


6 07 2008

QuickSort. It’s widely accepted as the fastest generic sorting algorithm around. It’s also very simple. A comment in the last article showed me this Haskell beauty:

qsort []     = []
qsort (x:xs) = qsort (filter (< x) xs) ++ [x] ++ qsort (filter (>= x) xs)

While my C implementations aren’t any where as beautiful, I’m quite satified with their efficiencies. I’ll keep the code to a minimum, and the let the graphs do the talking.

Read the rest of this entry »

Mergesort. Dissected.

4 07 2008

(Note: All code in this under the WTFPL [0]. Except possibly for Stepane Delcroix’s adapted code, which is under the MIT/X11 license)

Very recently, I decided to spend some time coding those standard algorithms that every programmer should know, but I am woefully ignorant of. The plan was to do an algorithm a day. Unfortunately, yesterday night, I started on the Merge sort algorithm, and I found some ancient bash script I wrote to profile and graph the running time of some other sorts (i.e. the bubble sort). Which led to me spending precious time playing around with gnuplot and various program parameters. Expect graphs. Lots of them.

Read the rest of this entry »