Pointer: Pointer will allow the user to indirectly access and manipulate the variable data contents. A pointer variable will hold the address of the data contents. If an asterisk “” operator is present before the variable then that variable is referred as pointer variable. An asterisk “” is also referred as indirection operator is used to dereferences the pointer. Representing array using pointer notation: In general array will have a continuous allocation of memory bytes, to represent the values present in the array it can be represented using its subscript value. So to represent the values using pointer notation with an indirection operator the name of the array plus the subscript representing the value needs to be specified. When we represent only the array name, it will indicate the first element of the array. To represent the next element we need to increment the values by one to find the proceeding elements of the array.

Question

Want to see the full answer?

Answer 1

Question

Chapter 10, Problem 17RQE

Program Plan Intro

Pointer:

Pointer will allow the user to indirectly access and manipulate the variable data contents. A pointer variable will hold the address of the data contents. If an asterisk “” operator is present before the variable then that variable is referred as pointer variable. An asterisk “” is also referred as indirection operator is used to dereferences the pointer.

Representing array using pointer notation:

In general array will have a continuous allocation of memory bytes, to represent the values present in the array it can be represented using its subscript value.

So to represent the values using pointer notation with an indirection operator the name of the array plus the subscript representing the value needs to be specified.

When we represent only the array name, it will indicate the first element of the array.

To represent the next element we need to increment the values by one to find the proceeding elements of the array.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Design a dynamic programming algorithm for the problem described below Input: A list of numbers A = = [a1,..., an]. Output: A contiguous subsequence of numbers with the maximum sum. The algorithm must take O(n) time. You must also write and explain the recurrence. (I am looking for an i ≥ 1 and k ≥ 0 such that a + ai+1 + ···ai+k has the largest possible sum among all possible values for i and k.) Example 1: Input: A[5, 15, -30, 10, -5, 40, 10]. Output: [10, 5, 40, 10] Example 2: Input: A = [7, 5, 7, 4, -20, 6, 9, 3, -4, -8, 4] Output: [6,9,3]

Design a dynamic programming algorithm for the Longest Increasing Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest increasing subsequence among these integers. The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [5, 3, 6, 8, 4, 6, 2, 7, 9, 5] Output: 5 ([3, 4, 6, 7, 9]) Example 2: Input: [12, 42, 66, 73, 234, 7, 543, 16] Output: 6 ([42, 66, 73, 234, 543])

Design a dynamic programming algorithm for the Subset Sum problem described below: Input: A set of n integers A and an integer s Output: A subset of A whose numbers add up to s, or that no such set exists. The algorithm must take O(n·s) time. You must also write and explain the recurrence. Example 1: Input: A = {4, 7, 5, 2, 3}, s = 12 Output: {7,2,3} Example 2: Input: A{4, 7, 5,3}, s = 6 Output: 'no such subset'