CS 54 - Lab 8

Lab Assignment

Today we will learn about one of the more interesting problems in programming: sorting. There are many sorting algorithms available, each with its own merits and disadvantages. The first algorithm we will see is called bubble sort, so named because the smaller items “bubble” to the front of the array.

Lab Assignment - Part I (Required - 8 Points)

Implement a function that, given an array an array of size integers, will sort the array using the bubble sort algorithm:
void bubbleSort(int inputArray[], int size);
In your main(), create an array of 30 random integers and sort them using the bubbleSort() function.

Lab Assignment - Part II (Required - 10 Points)

Write a function called void printArray(int inputArray[], int size); that will print an array with size number of integers.

Lab Assignment - Part III (Extra Credit - 12 Points)

Choose one of the following for extra credit:

• Modify bubbleSort() and printArray() to be templated so that they can sort/print ANY basic type.
• Sort another array of 30 random integers using qsort() (HINT: #include <cstdlib>).
• Create four random arrays of sizes 100000, 250000, 500000, and 1000000. Use time functions to measure how much time it took to sort each array. Then print how much time it took to sort each array.
• Come up with your own idea related to sorting (instructor approval required).

Each option is worth 2 points. Choose one and only one to qualify for Part III. Doing more than one option will not let you attain more than two extra points (i.e., doing two options is not worth four points).

Grading & Submission

• Correctness - 70%
  1. Does it compile?
  2. Does it work?
  3. Are there any bugs?
  
  
• Coding Style - 30%
  1. Each level of indentation is two spaces.
  2. The program is commented.
  3. The program conforms to the coding standards as outlined by the CS 54 Style Guide.