To access the full text documents, please follow this link: http://hdl.handle.net/2117/93015
Title:
|
Improving mergesort for linked lists
|
Author:
|
Roura Ferret, Salvador
|
Other authors:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
Abstract:
|
We present a highly tuned mergesort algorithm that improves the cost bounds when used to sort linked lists of elements. We
provide empirical comparisons of our algorithm with other mergesort algorithms. The paper also illustrates the sort of
techniques that allow to speed a divide-and-conquer algorithm. |
Subject(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Mergesort -Algorithm -Divide-and-conquer algorithm |
Rights:
|
|
Document type:
|
Article - Submitted version Report |
Share:
|
|
Show full item record