Monthly Archives: January 2012

Insertion Sort on A Glance

My first encounter on my journey to re-learn algorithm is the insertion sort algorithm. This the code that I took from TADM book: insertion_sort(item s[], int n) { int i,j; /* counters */ for (i=1; i<n; i++) { j=i; while … Continue reading

Posted in Uncategorized | Leave a comment

To log(n)

I’ve stumbled upon this site . It contains a list of competency for programmer, from the basic and to the expert. Reading on the list, I mostly on Level 2 or n (this is a term used in analysis of … Continue reading

Posted in Algorithms | Tagged | Leave a comment