I’m glad to announce the new release of the algorithms and data structures summary. The new release brings the an extended FPTAS solution for the knapsack problem and a a comparison of sort algorithms. From this release on I’m working with Christian to get a better and faster progress in this. There are some issues [...]
Read Full Post »
Id like to announce that the newest revision of the summary about data structures and algorithms is out now. It covers the whole lecture from the beginning up to the topic insertion sort (excl interpolation search) I will publish it online next week because I’d like finishing the whole search/sort part before releasing it.
Read Full Post »
Three Weeks passed and it seems that this course is one of the hardest one. Finding a way to solve a problem with less possible steps is not quite easy even though our normal approach does not increase the performance. The course by Prof. Peter Widmayer is well presentet though sometimes a bit fast and abstract [...]
Read Full Post »