some notes about Sort algorithm and their performance measurements:
we need to pay attention to some concepts on how these algorithms are designed:
- linear — do the sort in place and take an array as a whole.
- divide and conquer — break the questions into smaller chunks
to measure performance
- number of swaps (Swap Methods)
- number of comparisons (Find methods )
to measure their orders: BIG- O notation