C++

Screenshot of the output required

THIS IS THE ASSIGNMENT

THIS IS THE CCP file

I couldnt write out the code because its too long and Chegg do not allow me , so there is the screenshot

AT&T 1:19 AM Lab03 Detail Submission Back Grade Lab03 Due: Feb 25, 2019 at 11:59 PM This lab provides practice using multiple sorting techniques. The attachments provide specific lab instructions and also a "template" with some provided code to use for your sorting examples. The bubble sort and insertion sort should be sorted in ascending order, the selection sort should be sorted in descending order Lab03revisedjlc.pdf Lab03.cpp Previous Next DashboardCalenda Notifications nbox To Do AT&T 1:17 AM 18% Lab03revisedjlc.pdf Q Howard County Community College LAB 3 CMSY-171 Sorting and Pointers (45 points) In this lab, you will sort an array of constant integers in place using three different techniques 1. reset function will be used to set the array to the original numbers 2. displayIntArray will be used to printout the content of the sorted array 3. displayPtEArray will be used to printout the pointer addresses of each of the elements of the pointer array. This must be done before and after each sort is done (no text should be displayed in this function). Bubble sort function will be called which will use the bubble sort technique to sort the content of the pointer array such that when you iterate through the array and print out its content, the integers will be in ascending sorted order 4. Every time you change the content of the elements of the pointer amay, print out the entire pointer array by calling the woid displayPteArrayDezet function. But only display the contents when the elements in the array have changed S. The Selection sort (the code for the function is given) function will be called which will use the selection sort technique to sort the content of the pointer array such that when you iterate through the array and print out its content, the integers will be in descending sorted order. Every time you change the content of the elements of the pointer anray, print out the entire pointer array by calling the void displayPtEArrayDeref function. But only display the contents when the elements in the array have changed 6. The Insertion sont function will be called which will use the insertion sort technique to sort the content of the pointer array such that when you iterate through the array and print out its content, the integers will be in ascending sorted order Every time you change the content of the elements of the pointer array, print out the entire pointer array by calling the displayPtrArrayDeret funetion. But only display the contents when the n elements in the aray have changed 7. The last line will contain the phrase "Sorting Complete" and your name 8. Your output should match the following pages. Page 1 of 3 Dashboard Calendar To Do Notifications Inbox AT&T 1:17 AM 18% Lab03revisedjlc.pdf Q ING 20 10 30 30 is the content of the sorted array of pointersi Ox7ffed20Ba144 0x7ffed208al4e Ox7ffed208a140 Ox72fed208a148 is the content of the orted array of pointers dereferenced 30 Here is the content of the array in the ORIGINAL orders is the content of the array of pointers in thORIGINAL order Insertion Sort 20 10 30 10 Here is the content of the array in the ORIGINAL order Here is the content of the array of pointers in the ORIGINAL orderI SORTINGubble Sort Sorting complete Here is the content of the sorted array of pointers: Here is the content of the sorted array of pointers dereferenced Here is the content of the array in the ORIGINAL order Here is the content of the array of pointers in the ORIGINAL orderi Dashboard Calendar To Do Notifications Inbox AT&T 1:17 AM 70 18% Lab03revisedjlc.pdf a Here is the content of the array in the ORIGINAL orders 20 40 10 30 Here is the content of the array of Pointers in the ORIGINAL order Ox7ffed208a140 0x7ffed208a144 0x7ffod208a148 0x7ffed208a14c Page 2 of 3 Howard County Community College LAB 3 Sorting complete Bere is the content of the sorted array of pointers: Bere is the content of the sorted array of pointers dereferenceds Ox7ffed208a148 0x7tfed208a140 0x7ffed208a14c 0x7ffed208a144 10 20 30 40 Done by JCarter sh: 1: pauses not found Progran finished with ezit code o Press ENTER to ex Dashboard Calendar To Do Notifications Inbox AT&T 1:37 AM Lab03 Lab03.cpp / Lab 3 #include #include #include #include using namespace std; /* Assign each int element address to elements of the array of int pointers in such a way that the address of the first element in the int array is assigned to the first element of the pointer array, the address of the second element in the int array is assigned to the second element of the pointer array, and so on void reset (const int start_num, const int *ptrl,int size) /*2. use a loop to display the content of the num array/ void displayIntArray (const int num[, int size) void displayPtrArray (const int *ptr,int size]) /*use a loop to display the content of the ptr array (showing addresses) void displayPtrArrayDeref (const int *ptr[, int size) /* use a loop to display the content of the ptr array dereferenced (showing values) Dashboard Calendar To Do Notifications Inbox AT&T 1:37 AM Lab03 Lab03.cpp 3. Bubble sort function will be called which will use the bubble sort technique that out its content, to sort the content of the pointer array such when you iterate through the array and print the integers will be in ascending sorted order Every time you change the content of the print out the entire array by calling the But only display the contents when the N elements of the array, displayPtrArrayDeref function elements in the array has changed. void BubbleSort (const int ptr, int size) /*The only thing you can change is the data type of the variable(s) relation operator(s) displayPtrArrayDeref. No extra variables, *(you can dereference a pointer), the (i.e> or size; index++) if (ptr[index] > *maxValue) maxValue = ptr [index ]; maxIndexindex; ptr[maxIndex]-ptrstartscan]; ptrstartscan]maxValue Dashboard Calendar To Do Notifications Inbox AT&T 1:38 AM Lab03 Lab03.cpp 5. You will repeat the same steps for Insertion sort. Every time you change the content of the elements of the pointer array, print out the entire pointer array by calling the displayPtrArrayDeref function But only display the contents when the N elements in the array have changed void InsertionSort (const int *ptr, int size) *The only thing you can change is the data type of the variable (s) relation operator (s) displayPtrArrayDeref function arguments, etc. *(you can dereference a pointer), the (i.e>or