ALGORITHMS

U ovom završnom radu ću prikazati i opisati devet algoritama sortiranja koji se koriste danas u raznolikim granama informatike i programiranja, te također u granama znanosti. U ovom radu sam usporedila vremensku i prostornu složenost navedenih algoritama te prikazala pseudokodove istih u programerskom jeziku Pythonu. Opisala sam nekoliko primjera algoritama umjetne inteligencije, te primjere NP i real-time problema. U praktičnom dijelu rada napravila sam vizualizaciju dva algoritma sortiranja, bubble sort i sortiranje umetanjem, programom napisanim u Pythonu.In this final thesis, I will present and describe nine sorting algorithms, which are used today in multiple branches of IT and programming, and also in multiple branches of science. In this thesis, I compared the time and space complexity of these algorithms, and presented pseudocodes for the algorithms in the programming language Python. I described a few algorithms used in the field of artificial intelligences, and also NP and real-time problems. In the practical project for this thesis I presented a visualization of two chosen sorting algorithms, bubble sort and insertion sort, written in Python