Data structures and complexity of algorithms in Java
| العنوان: | Data structures and complexity of algorithms in Java |
|---|---|
| المؤلفون: | Marelja, Josipa |
| المساهمون: | Perić, Jurica, Klaričić Bakula, Milica, Gotovac Đogaš, Vesna |
| بيانات النشر: | Sveučilište u Splitu. Prirodoslovno-matematički fakultet. Odjel za matematiku., 2022. |
| سنة النشر: | 2022 |
| مصطلحات موضوعية: | PRIRODNE ZNANOSTI. Matematika, stabla, složenost, rekurzija, recursion, sortiranje, trees, NATURAL SCIENCES. Mathematics, complexity, sorting |
| الوصف: | Ovaj rad pokriva ključne ideje za dizajniranje algoritama. Vidimo kako upotreba određenih struktura podataka pri dizajniranju algoritma može biti efikasnija od upotrebe drugih struktura podataka. Proučili smo standardne probleme poput sortiranja, dodavanja elemenata u određenu strukturu podataka kao i brisanje elemenata. Prošli smo kroz ključne strukture podataka poput listi, stogova, redova i binarnih stabala te pogledali njihov utjecaj na složenost prilikom dizajniranja algoritma za standardne probleme. Pokazali smo implementaciju navedenih algoritama u Java programskom jeziku te pokazali primjere u kojima odabir struktura podataka ne utječe na složenost algoritma i primjere kada odabir ispravne strukture podataka za dani problem smanjuje složenost algoritma za dani problem. This paper covers the key ideas for designing algorithms. We see how the use of certain data structures when designing an algorithm may be more efficient than the use of other data structures. We studied standard problems such as sorting, adding and deleting elements to a certain data structure. We went through key data structures such as lists, stacks, queues and binary trees and looked at their impact on complexity when designing algorithms for standard problems. We showed the implementation of the mentioned algorithms in the Java programming language and showed examples in which the selection of data structures does not affect the complexity of the algorithm and examples when the selection of the correct data structure for a given problem reduces the complexity of algorithm for the given problem. |
| وصف الملف: | application/pdf |
| اللغة: | Croatian |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7db4423fce860ba69166787e77cc8165 https://repozitorij.svkst.unist.hr/islandora/object/pmfst:1563/datastream/PDF |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.dedup.wf.001..7db4423fce860ba69166787e77cc8165 |
| قاعدة البيانات: | OpenAIRE |
| الوصف غير متاح. |