C / C++ Code Portfolio

if (*(ptr + ptrIndex) == value)
{
return(ptr + ptrIndex);
}
}
return(NULL);
}
// This function computes the average element value for a 4-D array using two methods. The first method
// accesses the elements of the array using 4 nested for loops and 4-D indexing. The second method
// accesses the elements of the array using linear compact pointer notation.

#include "C2A4E1_ArraySize.h"

void ComputeAverages(float (*anArray)[DIM1][DIM2][DIM3], float *nestedAvg, float *linearAvg)
{
float subTotal = 0;
// access the elements using 4 nested for loops and 4-d indexing
for (int index0 = 0; index0 < DIM0; ++index0)
for (int index1 = 0; index1 < DIM1; ++index1)
for (int index2 = 0; index2 < DIM2; ++index2)
for (int index3 = 0; index3 < DIM3; ++index3)
subTotal += anArray[index0][index1][index2][index3];
*nestedAvg = subTotal / Elements4D;
subTotal = 0;
// access the elements using compact pointer notation
for (float *ptr = (float *)anArray; ptr < (float *)anArray + DIM0 * DIM1 * DIM2 * DIM3; ++ptr)
subTotal += *ptr;
*linearAvg = subTotal / Elements4D;
}
// This function sorts values in an array in descending order using a bubble sort algorithm

#include

float *SortValues(float *first, size_t elements)
{
// store the location of the last element array
float *last = &first[elements - 1];
// the bubble sort algorithm
bool didSwap;
do
{
didSwap = false;
// for each non-bubbled element of the array
for (float *current = first, *nextCurrent = current + 1; current < last; ++current, ++nextCurrent)
{
// if the current array value is less than the next array value, swap them