Meta-algoritmos de ordenación

  1. Raposo García, Rodrigo
Supervised by:
  1. Honorino Mielgo Álvarez Director

Defence university: Universidad de León

Fecha de defensa: 05 February 2016

Committee:
  1. Francisco Javier de Cos Juez Chair
  2. Ramón Ángel Fernández Díaz Secretary
  3. Maria Rosa Estela Carbonell Committee member
Department:
  1. ING. MECÁNICA, INFORMÁTICA Y AEROESPACIAL

Type: Thesis

Teseo: 393183 DIALNET lock_openBULERIA editor

Abstract

The fundamental core task in Information Systems is to sort, classify and search data, which spend between 25 and 50 percent of his time. Usually the sort task is not and end in itself, but rather a fundamental task that lies between two processes: a producer that generates elements for a consumer which demand it according to an predeterminated order. This Thesis thoroughly analyses how sort classic algorithms work, and defines a new taxonomy based on abstract their respective implementation of control and data structures. Sorting is addressed in its broadest and pure form and a solution is offered independently of the hardware architecture and the chosen programming language.