Moderate# Choosing the Fastest Algorithm from Big O Bounds

ALGOR-8XIVLS

Each of the following big O bounds comes from a different sorting algorithm. Which algorithm would you choose to sort a list of ${16}$ integers the fastest, assuming identical constants and worst case performance for each algorithm?