# Sorting trade-off

## 1.Sorting

* The algorithm of sort entities in ascending or descending order
* This is the foundation for more difficult problems

## 2.**Trade-off in sorting**

* What is the complexity of the algorithm used?
  * How does it scale as the input size increase?
* How much space does it occupy?
  * Does it needs extra space to hold information during sorting?
* Is the sort stable?
  * Do equal elements maintain their original order after sorting?
* How many comparisons and how many element swaps are needed?
  * Do the algorithms work better with nearly sorted lists?
* Is the sort adaptive?
  * Does it break early when the list is sorted?





























