Problem
Understanding of the Big Oh notation and how it can be applied to the different sorting algorithms, discuss how this knowledge can affect the 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. support the answers with examples.