At last, I have implemented the edit distance.
It was not that hard after all. Thanks to some of my training mates for helping me out understand what was written in Steven Skiena’s book. I am really slow in comprehending things.
I have to fully understand other dynamic programming algorithms.
Category Archives: Computer Science
Edit Distance, implemented!
14-Sep-09Edit Distance, Least Common Subsequence
10-Sep-09Yesterday after a whole day of volunteering to a certain annual IT event, we had our lecture on dynamic programming. We specifically tackled the usual Fibonacci sequence and binomial coefficients. Those few topics were relatively easier than the next problems; edit distance, least common subsequence, least increasing subsequence among others.
Those topics blew my mind. I [...]
Programming Challenges
07-Sep-09Last March, I started playing Programming Challenges thru Universidad de Valladolid’s online judge to keep my brain lubricated at all times.
I highly recommend the website for Computer Science majors and even programming enthusiasts. All you need is basic Java or C and your brain. Knowledge on standard algorithms is also a good start but monstrous [...]
Floyd-Warshall algorithm
06-Sep-09The other day, I attempted to plan an itinerary for my upcoming trip to London. Sadly, there were no direct flights to London from Cebu, Philippines.
As I was brainstorming on how to plan my flight such that I would incur the minimum cost, I remembered that I had access to the “secret” discounted airfare database [...]