Sorting is a common and yet very important operation that is used in a wide number of scenarios in computing to arrange data in a specific order. Numerous algorithms have been proposed to date, to accomplish sorting. Identify and explain any 2 algorithms that could be used for sorting.
Explain the time complexity of the chosen algorithms (Best-Case / Worst-Case). Use the time complexity measures to explain the suitability of the algorithms to sort a given data set. You may consider various attributes such as size/ volume of the data, desired speed of processing etc. to justify your answer