Skip to content

Latest commit

 

History

History
47 lines (25 loc) · 1.36 KB

README.md

File metadata and controls

47 lines (25 loc) · 1.36 KB

complexity-experiment

Experiments with sorting algorithms

Objective

The objective of this project is to analyze aspects of the performance of a computer system with the execution of sorting algorithms, applying the methodology of conducting experiments. Therefore, an experiment will be designed to find how the execution of a type of ordering algorithm, the input size and the computer system interact with each other and their level of impact on the performance of each of these factors.

Response variable:

  • Execution time

Factors of study:

  • Machine
  • Input size
  • Sorting algorithm(MergeSort, SelectionSort).

Documentation

Problem Statement

Report

Data

Results

Exploratory data analysis

Boxplot

ANOVA

Merge Sort

Merge Sort

Interaction plot

Authors

Sebastián García Acosta

Christian Gallo Peláez

Juan Fernando Angulo Salvador