C$++$ ONLY

Assignment tasks:

$(3$ points$)$ Create a new file called pointerBasics.cpp$.$ Write a $C++$

program in this new file. In this new file, write code that will do the

following:

a$.(1$ point$)$ Declare and assign values to variables

i$.$ Declare an integer variable called myInt and assign the

value $15$ to it$.$

ii$.$ Declare a pointer variable called myPointer using the

dereference operator $(**)$ and assign it to the memory

location of myInt using the address$-$of operator $($&$)$

b$.(1$ point$)$ Print to console

i$.$ Print the memory address $($this should be in

hexadecimal, i$.$e$.,0$x$1234$ format$)$ of myInt $($remember the

address$-$of operator!$).$ Then print the value contained in

the variable myPointer.

ii$.$ Print the value $($this should be an integer$)$ of myInt $.$ Then

print the value pointed to by myPointer $($Hint: remember

the dereference operator!$)$

c$.(1$ point$)$ Change values and print to console

i$.$ Reassign the value of myInt from $15$ to $10$ using an

assignment operator.

ii$.$ Print the memory address $($this should be in

hexadecimal, i$.$e$.,0$x$1234$ format$)$ of myInt $($remember the

address$-$of operator!$).$ Then print the value contained in

the variable myPointer.

iii. Print the value $($this should be an integer$)$ of myInt $.$ Then

print the value pointed to by myPointer $($Hint: remember

the dereference operator!$)$

$2.$Create a new file named array$\_$ptrs$.$cpp and in this file, write a

program that does the following:

a$.$ Defines an array of integers called my$\_$ints with a pre$-$specified

size of $4.$

b$.$ Populates my$\_$ints with input data provided by the user.

c$.$ Defines an array of pointers called my$\_$ptrs of the same size as

my$\_$ints and initializes the pointers in my$\_$ptrs to point to

corresponding elements of the array my$\_$ints $($refer to the "Initial

state of my$\_$ptrs$"$ in the example shown below$)$

d$.$ Sort the contents of the my$\_$ptrs array in ascending order. You

are allowed to use any existing sorting algorithm $($two simple

options are Bubble Sort and Insertion Sort; you may use either

one or choose another one if you prefer$).$ However, you are NOT

allowed to use a library implementation of the algorithm. You

must implement the algorithm from scratch.

e$.$ What you have done above is to sort the values contained in the

my$\_$ptrs array, i$.$e$.,$ you have sorted memory addresses. Now,

update your code to sort the my$\_$ptrs array based on the

integers that are being pointed to$,$ i$.$e$.,$ the first element of

my$\_$ptrs should point to the smallest element in my$\_$ints, the

second element of my$\_$ptrs should point to the next larger

element in my$\_$ints, etc. $($refer to the "State of my$\_$ptrs after

Step $2e^{\text{'}\text{'}}$ in the example shown below$).$ The my$\_$ints array

should NOT be changed in any way; the values should stay in the

same position. You have already implemented this part of sorting

from the steps above, but that was not using pointers, so now

you need to sort it using pointers.

f$.$ Traverse the array my$\_$ptrs and print the values being pointed to

by each pointer in this array.

Example: