Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

The following code produces a compiler warning about Line #43 (the call to DumpBytes in CopyAndSort). What output does this particular call to DumpBytes produce

The following code produces a compiler warning about Line #43 (the call to DumpBytes in CopyAndSort). What output does this particular call to DumpBytes produce and why does the code produce this behavior? Why does gcc believe it is worth warning us about this?

#include // for printf

#include // for EXIT_SUCCESS

#include // for uint8_t, PRIx8, etc.

// Size of data arrays

#define ARRAY_SIZE 11

// Copy len elements from source to dest, placing elements

// in dest in non-decreasing order.

void CopyAndSort(uint8_t source[], uint8_t dest[], int len);

// Given that array[0..len-1] is sorted in non-decreasing order, add

// num to array in the proper place so that array[0..len] is sorted.

// precondition: len > 0.

void DoInsert(uint8_t num, uint8_t array[], int len);

// Prints the parameter byte_len in decimal,

// the address held by the parameter data in hex,

// and byte_len bytes in hex starting at data

void DumpBytes(void* data, int32_t byteLen);

// Note that we pass in sizeof(arr) / sizeof(uint8_t)

// since the sizeof(array) is the length * sizeof(element)

int main(int argc, char* argv[]) {

int32_t int_val = 1;

float float_val = 1.0f;

uint8_t arr_unsorted[] = {3, 2, 0, 8, 17, 6, 10, 7, 8, 1, 12};

uint8_t arr_sorted[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};

DumpBytes(&int_val, sizeof(int_val));

DumpBytes(&float_val, sizeof(float_val));

DumpBytes(arr_unsorted, sizeof(arr_unsorted));

CopyAndSort(arr_unsorted, arr_sorted, ARRAY_SIZE);

DumpBytes(arr_sorted, sizeof(arr_sorted));

return EXIT_SUCCESS;

}

void CopyAndSort(uint8_t source[], uint8_t dest[], int len) {

// Note how this would only dump 8 bytes since sizeof(source)

// is only 8 bytes, not the length of the array.

DumpBytes(source, sizeof(source));

// Deal with the degenerate case of a zero-length array

// (nothing to do in that case)

if (len == 0) {

return;

}

// Insertion sort

// Copy first element

dest[0] = source[0];

// Insert remaining entries in order in dest.

for (int i = 1; i

DoInsert(source[i], dest, i);

}

}

void DoInsert(uint8_t num, uint8_t array[], int len) {

// precondition: len > 0 && array[0..len-1] sorted in non-decreasing order

int i = len;

// invariant: array[0..i-1] not checked and array[i+1..len] > num.

while (i > 0 && array[i-1] > num) {

array[i] = array[i-1];

i--;

}

// array[0..i-1] num=>

array[i] = num;

}

void DumpBytes(void* pData, int32_t byteLen) {

uint8_t* ptr = (uint8_t*) pData;

printf(\"The %\" PRId32 \" bytes starting at 0x%\" PRIxPTR \" are: \",

byteLen, (uintptr_t) pData);

for (int i = 0; i

printf(\"%s%02\" PRIx8, (i > 0 ? \" \" : \"\"), ptr[i]);

}

printf(\" \");

}

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access with AI-Powered Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Introduction To Federal Income Taxation In Canada 2016-2017

Authors: Robert E. Beam, Stanley N. Laiken, James J. Barnett

37th Edition

9781554968725

Students also viewed these Programming questions

Question

1-5 Outline the plan of this book.

Answered: 1 week ago