Analysis of algorithms is the area of computer science that provides tools to analyze the eciency of dierent methods of solutions.

The strength of a search algorithm reveals on a data comprising a great deal of instances. For such a data set, it is expected to observe that the sorting algorithms having worse performance in terms of complexity like selection sort, insertion sort, or bubble sort require higher amount of time whereas those having better performance like merge sort or quick sort nish the process faster, which is an expected case within the scope of this assignment.