introduction the primary objective of this lab is for you to apply your theoretical knowledge of sorting algorithms to solve a problem of poor user interface design. more specifically, you will be given a program which is designed to measure comparisons, data movements, and execution time for the seven sorting algorithms discussed in class. unfortunately, the designer of the program did not label the buttons properly. you must apply your understanding of the general properties of the algorithms (and in some cases of the code used to implement them) to determine the proper labeling of the buttons. the secondary objective of this lab is for you to gain experience writing a concise, but complete analysis of a system. 2 background as you know from class, if you double the size of the data set that you give to a quadratic algorithm, it will do four times the work; by contrast, an o(n log n) algorithm will do a bit more than twice as much; and, a linear algorithm will do only twice as much work. as you also know, the characteristics of the input data set can affect the expected performance of many of our sorting algorithms. before you begin the lab, you should review the expected performance of the algorithms on various data sets. the sorting algorithms under study include (in alphabetical order): bubble sort(not optimized), insertion sort, merge sort, quick sort heap sort, and selection sort.