Treffer: JavaFX GUI aplikacija za testiranje algoritama sortiranja ; JavaFX GUI application for testing sorting algorithms
Josip Juraj Strossmayer University of Osijek. Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Department of Software Engineering. Chair of Programming Languages and Systems.
Weitere Informationen
U sklopu ovog završnog rada izrađena je JavaFX GUI aplikacija za testiranje odabranih algoritama sortiranja koja rješava problem odabira najbržeg odnosno najefikasnijeg algoritma. Programski kôd je pisan Java programskim jezikom u Eclipse razvojnom okruženju koji je povezan sa Scene Builder programskim alatom za generiranje JavaFX komponenti korisničkog sučelja. Korisničko sučelje na intuitivan način omogućava korisniku unos parametara za generiranje uzoraka na temelju kojih se provodi testiranje algoritama sortiranja. Dobiveni rezultati testiranja se mogu spremiti u JSON datoteku te ih je kasnije moguće ponovo učitati radi vizualnog prikaza rezultata u obliku grafova, ali i radi novog testiranja. Na temelju rezultata dobivenih izrađenom aplikacijom moguće je algoritme podijeliti na spore (Bubble, Insertion i Selection sort) i brze (Quick, Merge i Heap sort), te je moguće jednostavno s grafa očitati vrijeme potrebno za sortiranje kao i broj usporedbi tijekom sortiranja odabranim algoritmima. ; As part of this final thesis, a JavaFX application was developed for testing selected sorting algorithms. The application solves the problem of selecting the fastest i.e. the most efficient algorithm. The code is written in Java programming language using Eclipse development environment which is linked to the Scene Builder software tool for generation of the JavaFX user interface components. The user interface is interactive with user in such a way that user enters sample generation parameters for which the test is being performed. The resulting test data can be saved to a JSON file so that it can be later reloaded for visual display in the form of graphs, as well as for new testing. The results obtained by using the application created for the purpose of this final thesis make it possible to classify sorting algorithms into slow (Bubble, Insertion and Selection sort) and fast (Quick, Merge and Heap sort) and the time required for sorting can be easily read from the graph as well as the number of comparisons sorting the ...