Question: If you sort an array, you must physically move/swap the data from its original location to another location. Small arrays not a real problem, the

If you sort an array, you must physically move/swap the data from its original location to another location. Small arrays not a real problem, the larger the number of items, the more I/O overhead involved. What if we need to keep that array in its original order? Creating duplicate arrays is not a solution. How about using memory pointers?

What if we use a shadow array of pointers to each index location in the original array? The pointer addresses are swapped instead of the actual data values.

Load an integer array (called it numbers) of size 15 with random integer values ranging from 1 to 100

Create two additional arrays of pointers, aim the array index pointers to the integer array

Pass the first array of pointers to a sort function to sort ascending order the pointer values based on the value that these pointers are pointing to in the numbers array. The pointer values will be swapped within the pointer array.

Pass the second array of pointers to a function to sort descending order the pointer values based on the value that these pointers are pointing to in the numbers array. The pointer values will be swapped within the pointer array.

Display the contents of the numbers array

Display the numeric values that the ascending pointer array and the descending pointer array are pointing at in the numbers array.

You will need to code an ascending and descending sort (simplest is a bubble)

Output Example:

Display the contents of the Array:

Index # 0 18

Index # 1 11

Index # 2 55

Index # 3 50

Index # 4 45

Index # 5 40

Index # 6 76

Index # 7 80

Index # 8 75

Index # 9 79

Index # 10 85

Index # 11 96

Index # 12 12

Index # 13 42

Index # 14 11

Display the contents of the Array via the "shadow" pointer Array I:

Index # 0 18 @ Memory Location 0x24feb4

Index # 1 11 @ Memory Location 0x24feb8

Index # 2 55 @ Memory Location 0x24febc

Index # 3 50 @ Memory Location 0x24fec0

Index # 4 45 @ Memory Location 0x24fec4

Index # 5 40 @ Memory Location 0x24fec8

Index # 6 76 @ Memory Location 0x24fecc

Index # 7 80 @ Memory Location 0x24fed0

Index # 8 75 @ Memory Location 0x24fed4

Index # 9 79 @ Memory Location 0x24fed8

Index # 10 85 @ Memory Location 0x24fedc

Index # 11 96 @ Memory Location 0x24fee0

Index # 12 12 @ Memory Location 0x24fee4

Index # 13 42 @ Memory Location 0x24fee8

Index # 14 11 @ Memory Location 0x24feec

Sorting the shadow pointer array in the function (Ascending Order)

Display the Sorted Ascending contents of the Array

via the "shadow" pointer Array I:

Index # 0 11 @ Memory Location 0x24feec

Index # 1 11 @ Memory Location 0x24feb8

Index # 2 12 @ Memory Location 0x24fee4

Index # 3 18 @ Memory Location 0x24feb4

Index # 4 40 @ Memory Location 0x24fec8

Index # 5 42 @ Memory Location 0x24fee8

Index # 6 45 @ Memory Location 0x24fec4

Index # 7 50 @ Memory Location 0x24fec0

Index # 8 55 @ Memory Location 0x24febc

Index # 9 75 @ Memory Location 0x24fed4

Index # 10 76 @ Memory Location 0x24fecc

Index # 11 79 @ Memory Location 0x24fed8

Index # 12 80 @ Memory Location 0x24fed0

Index # 13 85 @ Memory Location 0x24fedc

Index # 14 96 @ Memory Location 0x24fee0

Sorting the shadow pointer array in the function (Descending)

Display the Sorted Descending contents of the Array

via the "shadow" pointer Array II:

Index # 0 96 @ Memory Location 0x24fee0

Index # 1 85 @ Memory Location 0x24fedc

Index # 2 80 @ Memory Location 0x24fed0

Index # 3 79 @ Memory Location 0x24fed8

Index # 4 76 @ Memory Location 0x24fecc

Index # 5 75 @ Memory Location 0x24fed4

Index # 6 55 @ Memory Location 0x24febc

Index # 7 50 @ Memory Location 0x24fec0

Index # 8 45 @ Memory Location 0x24fec4

Index # 9 42 @ Memory Location 0x24fee8

Index # 10 40 @ Memory Location 0x24fec8

Index # 11 18 @ Memory Location 0x24feb4

Index # 12 12 @ Memory Location 0x24fee4

Index # 13 11 @ Memory Location 0x24feb8

Index # 14 11 @ Memory Location 0x24feec

Display the contents of the Array:

Index # 0 18

Index # 1 11

Index # 2 55

Index # 3 50

Index # 4 45

Index # 5 40

Index # 6 76

Index # 7 80

Index # 8 75

Index # 9 79

Index # 10 85

Index # 11 96

Index # 12 12

Index # 13 42

Index # 14 11

Run this Again (Y or N):

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

If you sort an array, you must physically "move/swap" the data from its original location to other location. Small arrays not a real problem, the larger the number of items, the more I/O verhead...

Jupiter Notebook We have covered some of the limitations of single layer neural networks in class, but they are still powerful learning systems that provide a good way to begin learning about how to...

For your first project, write a C program (not a C++ program!) to read in a given list of non- negative integers and store them in a dynamic array. Then create another dynamic array and copy the...

Python and most Python libraries are free to download or use, though many users use Python through a paid service. Paid services help IT organizations manage the risks associated with the use of...

The purpose of this lab is to help reinforce container class concepts in C++. Specifically, the lab to implement sequence class using a dynamic array. Please use the provided header file...

1411116 - Programming I Assignment #3 Due Date: November 30, 2016 Submission Instructions: Submit your assignment on the blackboard link, corresponding to your Section: Please follow the following...

A2. You will create, implement and test a sequence2 class. The material from Ch1 ~ 4 of the textbook can help you tremendously. You are welcome to use more advance skills than the techniques...

Planning is one of the most important management functions in any business. A front office managers first step in planning should involve determine the departments goals. Planning also includes...

One of the most important ADTs is the Dictionary and one of the most studied problems is sorting. In this assignment, you will write multiple implementations of sorting algorithms. In this...

THE BRITISH JOURNAL OF CRIMINOLOGY Vol. 17 January 1977 No. 1 NILS CHRISTIE (Oslo) f Abstract CONFLICTS are seen as important elements in society. Highly industrialised societies do not have too much...

1. In most ecological communities, plants are the first level of the trophic structure, known as producers. What do plants produce that supports the higher trophic levels of the community? (4) 2....

Suppose that a b are eigenvalues of the matrix Answer: Suppose that x = [1]. Let the basis B = {, ) be a basis of R, where U = Answer: . Calculate a. = 6 and 2 =B] - [3] [:] and the coordinates of x...

In a one-way ANOVA, what is the difference between the between-groups variance MSB and the within-groups variance MSW?

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

6. Go to www.capellauniversity.edu, the Web site for Capella Universitya university that offers online courses. Click on Online Learning on the left side of the page. View the short course demo and...

4. Go to www.mzinga.com. Mzinga provides software solutions for learning. Click on Technology. Then click on Mzinga Social Learning Suite. What learning solutions are provided by the Social Learning...

2. The Interactive Patient is a realistic interactive computer simulation of a patients visit to a physicians office. The Interactive Patient is a Web-based training program used to train medical...