2025-12-05 15:03:01

1. Description

This report analyzes the performance of different sorting algorithms (BubbleSort, InsertionSort, MergeSort) for various array sizes (N). We evaluate execution time and compare algorithmic complexity.

1.1. Session

  • Hostname: feelpp2

  • User: chabannes

  • Time Start: 20251205T150305+0100

  • Time End: 20251205T150322+0100

1.2. Cases

  • Total: 12

  • Failures: 0

  • Runs: 1

2. Parametrization

Hash algorithm elements Execution Time (s) logs_link

pass

6ecc6c9a

bubble

10.0

0.5899264812469482

Logs

pass

2765c5b9

bubble

100.0

0.5697417259216309

Logs

pass

5782ac85

bubble

1000.0

0.5730574131011963

Logs

pass

11bac4f8

bubble

10000.0

7.970259428024292

Logs

pass

33ce6d1a

insertion

10.0

0.5682032108306885

Logs

pass

c88da635

insertion

100.0

0.568549633026123

Logs

pass

0f3df295

insertion

1000.0

0.5765960216522217

Logs

pass

ecc08577

insertion

10000.0

2.7798447608947754

Logs

pass

ec6acac8

merge

10.0

0.5690357685089111

Logs

pass

83d6f296

merge

100.0

0.5692944526672363

Logs

pass

da99e8cb

merge

1000.0

0.5679435729980469

Logs

pass

ffd59599

merge

10000.0

0.5678677558898926

Logs

3. Performance Analysis

3.1. Execution Time vs Array Size

This plot compares execution times for different sorting algorithms as the array size increases, highlighting differences in algorithmic complexity.