---
id: 698dea167932b3cc4b19c947
title: Actual Run Time for Sorting Algorithms
challengeType: 11
videoId: AcHX25M4Cvk
dashedName: actual-run-time-for-sorting-algorithms
---

# --description--

In this video, you will compare the actual runtimes for the merge sort, quicksort and selection sort algorithms.

# --questions--

## --text--

What happened in the demo when the quicksort and merge sort algorithms were compared with a dataset of 1 million numbers?

## --answers--

Quicksort and merge sort were equal in their times.

---

Quicksort was slightly slower in sorting the numbers than merge sort.

---

Quicksort was slightly faster in sorting the numbers than merge sort.

---

Quicksort and merge sort both timed out and didn't provide any information.

## --video-solution--

3
