Josip Juraj Strossmayer University of Osijek Faculty of Electrical Engineering, Computer Science and Information Technology Osijek Department of Core Courses Chair of Mathematics, Physics and Mechanical Engineering
Cite this document
Vorgić, A. (2021). Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++ (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:102507
Vorgić, Amela. "Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:102507
Vorgić, Amela. "Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2021. https://urn.nsk.hr/urn:nbn:hr:200:102507
Vorgić, A. (2021). 'Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 23 August 2024, https://urn.nsk.hr/urn:nbn:hr:200:102507
Vorgić A. Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++ [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2021 [cited 2024 August 23] Available at: https://urn.nsk.hr/urn:nbn:hr:200:102507
A. Vorgić, "Brzi algoritam za problem trgovačkog putnika u programskom jeziku C++", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:200:102507