Access restricted to students and staff of home institution
undergraduate thesis
44   0
Solving Pancake Sorting Problem
Zrinka Šarić (2016)
University of Split
University of Split, Faculty of science
Department of Informatics
Cite this document...

Šarić, Z. (2016). Rješavanje problema sortiranja palačinki (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:446410

Šarić, Zrinka. "Rješavanje problema sortiranja palačinki." Undergraduate thesis, University of Split, University of Split, Faculty of science, 2016. https://urn.nsk.hr/urn:nbn:hr:166:446410

Šarić, Zrinka. "Rješavanje problema sortiranja palačinki." Undergraduate thesis, University of Split, University of Split, Faculty of science, 2016. https://urn.nsk.hr/urn:nbn:hr:166:446410

Šarić, Z. (2016). 'Rješavanje problema sortiranja palačinki', Undergraduate thesis, University of Split, University of Split, Faculty of science, accessed 27 March 2019, https://urn.nsk.hr/urn:nbn:hr:166:446410

Šarić Z. Rješavanje problema sortiranja palačinki [Undergraduate thesis]. Split: University of Split, University of Split, Faculty of science; 2016 [cited 2019 March 27] Available at: https://urn.nsk.hr/urn:nbn:hr:166:446410

Z. Šarić, "Rješavanje problema sortiranja palačinki", Undergraduate thesis, University of Split, University of Split, Faculty of science, Split, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:166:446410

Metadata
TitleRješavanje problema sortiranja palačinki
Title (english)Solving Pancake Sorting Problem
AuthorZrinka Šarić
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
University of Split, Faculty of science
(Department of Informatics)
Split
Defense date and country2016-09-14, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problem sortiranja palačinki se može riješiti u 2n - 3 okretaja za n ≥ 2, gdje je n broj zadanih palačinki. Analiza problema dovodi do sljedeće skice algoritma. Ponavljati sljedeći korak dok se problem ne riješi: donijeti najveću palačinku koja još nije u konačnom položaju na vrh s jednim okretajem, a zatim je postavi u konačni položaj s još jednim okretajem. Pokazano je da je svaku permutaciju stoga od n palačinki moguće sortirati u maksimalno 2n-3 okretaja. Algoritmi pretraživanja su implementirani u Python-u. Rezultati su analizirani i potkrijepljeni primjerima.
Abstract (english)
The pancake sorting problem can be solved in 2n − 3 flips where n ≥ 2 is the number of pancakes given. Analysis leads to the following outline of an algorithm. Repeat the following step until the problem is solved: bring the largest pancake not yet in its final position to the top with one flip, and then take it down to its final position with one more flip. It is shown that every permutation of n pancakes can be sorted in a maximum of 2n-3 flips. Search algorithms are implemented in Python. Results are analyzed and supported by the examples.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:446410
Study programmeTitle: Matematika i informatika
Study programme type: sveučilišni
Study level: preddiplomski
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike i informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike i informatike)
Type of resourcetext
File originBorn digital
Access conditionsRestricted access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
Created on2017-06-19 14:40:43