How do different sorts, such List-based Sorting, PQ-Sorting, and Heap-based Sorting, compare in terms of the time complexity required to complete the task?

Describe how the quantity of movements and comparisons impacts the temporal complexity of insertion sorting.

Consider sorting a list of items that are in reverse sorted order. If you were forced to pick between the three iterative sorting algorithms (bubble sort, selection sort, or insertion sort) to work through this set and place it into normal (ascending) sorted order, which would you pick and why?