Sorting algorithms in order value optimization

Author(s)

Andre Luis Trevisan

• Document type: Master's Dissertation
• Press: Campinas, SP.
• Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica
• Defense date: 2008-02-25

Examining board members

José Mario Martínez Pérez; Paulo José da Silva e Silva; Ricardo Caetano Azevedo Biloti

• Advisor: Sandra Augusta Santos; José Mario Martínez Pérez

Abstract

This paper deals with the Order-Value Optimization problem and it aims to investigate the role played for the sorting strategies, with sights the applications in the area of risk evaluation. Some classic methods for sorting are presented, as well as algorithms and adaptations to determine the element that occupies a given position in a vector. Throughout numerical experiments, it was possible to compare the performance of these methods and to verify which of them revealed more efficient towards the problem of determination of a given order statistics (AU)