Decision tree search algorithms visualisation

U ovom radu je obrađena tema “Vizualizacija algoritama pretrage na primjeru stabla odluke”. Zadatak je bio odabrati algoritme pretraživanja, objasniti način na koji rade, te napraviti eksperiment usporedbe algoritama. Da bi se objasnio pojedini algoritam, prvo se objasnilo što je to pretraživanje, algoritam pretraživanja, te stablo i njegovu konstrukciju. Rad svakog algoritma je objašnjen teoretski, preko pseudokoda i slikom. Kroz eksperiment se pokazalo kako koji algoritam reagira na promjenu određenih parametara, te su algoritmi međusobno uspoređeni.This paper deals with the topic "Decision Tree Search Algorithms Visualization". The task was to choose search algorithms, explain how they work, and make an experiment of their comparison. To explain a particular algorithm, first was explained the concept of search, search algorithm, tree and its construction. The work of each algorithm is explained theoretically, through a pseudocode and picture example. The experiment showed how the algorithm responds to the change of certain parameters, and the comparison of algorithms to each other