Give a Big-O estimate of the run time for the functions you wrote in Exercises 5 and 6.

Exercise 5

The specifications for the Unsorted List ADT state that the item to be deleted is in the list. 1. Rewrite the specification for DeleteItem so that the list is unchanged if the item to be deleted is not in the list. 2. Implement DeleteItem as specified in

(a) using an array-based implementation. 3. Rewrite the specification for DeleteItem so that all copies of the item to be deleted are removed if they exist. 4. Implement DeleteItem as specified in

(c) using an array-based implementation.

Exercise 6

Redo Exercise 5

(b) and 5(d), using a linked implementation.

Exercise 5.b and 5.d

b. Rewrite the specification for Delete Item so that all copies of the item to be deleted are removed if they exist.

d. Implement DeleteItem as specified in

(c) using an array-based implementation.

Transcribed Image Text:

Statements int value; value = 500; char* charPtr; char string[10] = "Good luck"; charPtr = string; // Exercise 13 cout < < &&value; cout < < value; cout < < &&charPtr; cout < < charPtr; cout < < *char Ptr; // Exercise 14 // Exercise 15 // Exercise 16 // Exercise 17 cout < < string[2]; // Exercise 18