Given your understanding of the Big Oh notation and how it can be applied to the different sorting algorithms, please discuss how this knowledge will affect your choice for the most appropriate algorithm for a given problem.

If two algorithms have the same complexity in terms of the Big Oh notation, does that mean they both will perform the same for all problems. Please support your answers with examples