| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:PRILAGODLJIV ALGORITEM UREJANJA Z ZLIVANJEM NA MESTU
Authors:ID Podbregar, David (Author)
ID Podgorelec, David (Mentor) More about this mentor... New window
ID Klajnšek, Gregor (Comentor)
Files:.pdf VS_Podbregar_David_2010.pdf (3,23 MB)
MD5: 669F9F0E5A77AF042DDCD089C8EAE944
PID: 20.500.12556/dkum/c68aac4e-8e6e-4332-96e6-6a8a672a9ad4
 
Language:Slovenian
Work type:Undergraduate thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu preučimo področje algoritmov urejanja podatkov in ugotovimo zakaj so trenutne rešitve neprimerne za probleme v računalniški geometriji, geometrijskem modeliranju in računalniški grafiki. Na pomanjkljivostih obstoječih rešitev razvijemo nov algoritem urejanja podatkov, ki predhodno bolj urejene podatke uredi v krajšem času kot povsem neurejene. Deluje povsem na mestu, kar pomeni, da potrebuje samo O(1) dodatnega prostora. V delu predstavimo idejo in implementacijo novega algoritma in ga primerjamo z obstoječimi rešitvami. Izpostavimo njegove prednosti in slabosti ter nakažemo izhodišča za nadaljnje raziskave.
Keywords:prilagodljivi algoritem, urejanje podatkov, urejanje z zlivanjem, zlivanje na mestu
Place of publishing:Maribor
Publisher:[D. Podbregar]
Year of publishing:2010
PID:20.500.12556/DKUM-15395 New window
UDC:004.925.8(043.2)
COBISS.SI-ID:14675478 New window
NUK URN:URN:SI:UM:DK:DBP6LWUP
Publication date in DKUM:20.09.2010
Views:2998
Downloads:283
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:ADAPTIVE SORTING ALGORITHM BASED ON INPLACE MERGING
Abstract:In this thesis we study the field of sorting algorithms and determine why the current solutions are not suitable for problems in computer geometry, geometric modeling and computer graphics. Based on the deficiencies of the existing solutions we develop a new sorting algorithm, which sorts more presorted data faster than completely unsorted data. It works entirely in-place which means that it needs only O(1) extra space. In this work we present the idea and implementation of the new algorithm and compare it with the existing solutions. We outline its advantages and disadvantages and point out results for further research.
Keywords:adaptive algorithm, data sorting, mergesort, in-place merging


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica