Sorting Strategies

A Study on the Most Famous Sorting Algorithms

Description

The goal of this project is to study different sorting strategies in terms of computational complexity and execution time. Our focus was on their behavior throughout time and according to the size of the data set to be sorted.

The implemented algorithms are:

• Quick Sort
• Merge Sort
• Shell Sort
• Heap Sort
• Insertion Sort
• Rank Sort
• Shaker Sort
• Bubble Sort
• Selection Sort

The results suggest that, in most cases, Quick Sort presents the best results.

Repository Structure

\docs - contains the written report on the study conducted and some additional resources

\src - contains the source code, written in C

Authors

The authors of this repository are Filipe Pires and João Alegria, and the project was developed for the Algorithms and Data Structures Course of the licenciate's degree in Informatics Engineering of the University of Aveiro.

For further information, please read our report or contact us at filipesnetopires@ua.pt or joao.p@ua.pt.