Many questions for Test 1 relate to code included in this repository. Take time to examine the programs in this repository prior to beginning the test.
You may want to have this repository open for reference while taking the test.
This program includes three functions, each a variation of the Bubble Sort algorithm. Descriptions of each variation appear in the source code just prior to each function implementation.
This program includes a recursive function for finding the maximum value in an array of integers.
This program creates a matrix (two-dimensional array) using the STL vector class. The array is populated with values. Comments are included at the beginning of the source code to describe how the matrix values are populated.
This program includes a non-recursive version of merge sort. It is basically the same as header file merge2.h that was included in the sort algorithm repository presented in class. The merge process uses pointer arithmetic, however the workings of the merge function are not referenced by any test questions. Only the mergesort function is involved in the test.
This program includes three functions, each of which calculates the sum of the integers 1 through N. One of the functions, sum2, is recursive.
This program includes two functions, each of which calculates the sum of the values in an array of integers. Both functions are recursive. See comments in the source code as to the approach for each function.