The 3rd Data Structures and Alogorithms homework was a real challenge. It didn’t only require a good programming, but also some algorithms knowledge. We have received 2 versions of the same homework last week: one easy homework and a difficult one. The difficult one comes also with a bonus.

When you see the possibility to achieve more than the usual through programming, you can be sure you’ll find me there. I’ve chose the difficult version. The problem consisted of determining the convex hull for a number of points on a 2D surface. Well, if I think that I’ve done it before, but with another algorithm, I can’t really say it’s difficult. The big challenge was actually the STL implementation which should have been made both memory and time efficient. It worked well after patching it several times because of wrong behaviour in special cases.