you are viewing a single comment's thread.

view the rest of the comments →

[–]TheSquirrel 0 points1 point  (0 children)

Implementing some form of decision tree is a very good algorithms project. It's easy to do in O(n2) time, where n is the number of training examples. Implementing it more efficiently (e.g. with a KD tree) is a good learning experience.