| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Naslov: Acceleration of sweep-line technique by employing smart quicksort Podgorelec, David (Avtor)Klajnšek, Gregor (Avtor) http://dx.doi.org/10.1016/j.ins.2004.07.002 Angleški jezik Neznano () 1.01 - Izvirni znanstveni članek FERI - Fakulteta za elektrotehniko, računalništvo in informatiko Quicksort is usually the best practical choice for sorting because it is, on average, remarkably efficient. Unfortunately, this popular algorithm has a significant drawback: the slowest performance is obtained in the simplest cases when input data are already initially sorted or only a slight perturbation occurs. In this paper, we propose a combination of quicksort and a new algorithm, which shows excellent time performance in sorting such crucial data arrays, and which is not much slower than quicksort in random cases. Our work was inspired by problems met when sorting polygon vertices in the sweep-line algorithms of computational geometry and, therefore, we have named the new algorithm 'vertex sort'. It splits the input array into three sub-arrays. Two of them are already sorted, and the third one is handled iteratively. A simple test decides whether to continue recursively with vertexsort or to employ quicksort in the second iteration. In this way, we achieve a situation where the worst case time complexity does not exceed the running times of quicksort, but the simplest cases are handled much faster (inlinear time) than random cases. We have named the combined algorithm 'smartquicksort' because of this desired property. In the last part of the paper, we prove its efficiency by employing it in a well-known sweep-line-based polygon triangulation algorithm. computational geometry, quicksort, smart quicksort, sweep-line, smart quicksort, polygon triangualation, vertex sort 2005 004.92 9318934 0020-0255 URN:SI:UM:DK:1YSCAPMZ 1203 47 Ostalo

Skupna ocena: (0 glasov) Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. AddThis uporablja piškotke, za katere potrebujemo vaše privoljenje.Uredi privoljenje...

Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Naslov: Information sciences Inf. sci. North-Holland 0020-0255 25613056

## Sekundarni jezik

Jezik: Angleški jezik računalniška geometrija, triangulacija mnogokotnika, hitro urejanje, navihano hitro urejanje, skanirna premica, urejanje ogljišč

## Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
 0 - 0 / 0 Ni komentarjev!

Nazaj