Bubble Sort Implementation The bubble sort makes multiple passes through a list. It compares adjacent items and exchanges those that are out of order. Each pass through the list places the next largest value in its proper place. In essence, each item “bubbles” up to the location where it belongs. Regardless of how the items… Read More »
Recently I have started using Python in a lot of places including writing algorithms for MI/data science, so I thought to try to implement some common programming problems using data structures in Python. As I have mostly implemented in C/C++ and Perl. Let’s get started with a very basic problem. Anagram algorithm An algorithm will… Read More »
Personal notes which I made during Andrew NG’s Stanford Machine learning class. Check this: https://github.com/ppant/MI-Class-Standord/blob/master/personal_notes.txt I am updating notes weekly. Stay tuned.
Investigating search engines and this time apache Lucy 0.4.2. I am showing a basic indexer and a small search application. See below code for indexer (This will take documents one by one and then index them). Search module will take arugument as STDIN and then will show the search result. This is pure command line utility just to… Read More »
Putting some thoughts mainly for newbies trying to understand REST. Sometimes I observed that the actual documentation on the web is too technical or abstract and scattered which a bit difficult for newbies.. I am writing down some broad points which in my view REST is and it’s equation with HTTP … these points based… Read More »
I found the pasted image on referred link Have to share …. Ref: http://caseytinsley.wordpress.com/2011/09/05/the-history-of-programming-languages/ Enjoy