C-style pointers are important to understand, because they live on in higher level languages. This lab will help you come to grip with pointers and how useful they can become. The bubble sort is an easy-to-implement algorithm for sorting a group of elements. Here's the basic algorithm: for i in list - 1 for j in list - 1 if list[j] > list[j 1] swap list[j] and list[j 1] Essentially, it looks through a list and checks each element against its neighbor. If an element is larger than the next element, the two elements should be swapped. One pass through the list is not sufficient to sort the entire list. The safest approach is to run the test in a pair of nested loops. (One could argue that this is not absolutely necessary or efficient, but that will be the subject of another lab.) The interesting part of this process from our current perspective is the swap() function. We need to give it two variables, and it needs to change the position of the values in those variables. When a function changes a single variable, we often simply have the function return a value and then we re-assign that value to the variable in question, but functions can typically only return a single value. How do you handle a case like swap where you want to change the values of two variables at once