For our input into this problem let\'s use the first 150 elements of the array H

ID: 3796712 • Letter: F

Question

For our input into this problem let's use the first 150 elements of the array

Here is the pseudo-code for one version of the Bubble Sort. This is an O(n2 ) algorithm that is based on two nested loops: outer loop index (i) runs from n-1 down to 1 o inner loop index (j) runs from 0 to i-1 ? compare array[j] and array[j+1]. Swap if array[j] > array[j+1] Here, n refers to the size of the data set, 150 in our case. Note that it is necessary to swap two values in the last line. This should be done with a swap() function as described below. As given, this algorithm would sort the original array of ints very well. However, in this assignment, we need to be able to sort the pointer array instead of the original int array. Although the sorting should be done according to the values the pointer array is pointing to, the only values actually changed are pointers. Therefore, this algorithm will have to be modified to work on the pointer array. Swap Function We will need a swap function that can swap the values of two argument pointers. In this case, our original data set consists of all ints. Therefore, the swap function needs to be able to swap pointers to ints. Displaying Data We will display the data both in sorted form and in unsorted form. The data should be displayed 10 numbers per line, each number in a 6 byte field. Functions should be used to display the data. Project Requirements (Overview) This is a high level outline of what needs to be accomplished in this assignment: 1) Initialize an int array of size 150 and load it with the data from eLearning (HW 3 Array Input). For purposes of discussion, call this array the Data Array. 2) Create an array of int pointers of the same size. For purposes of discussion, call this array the Pointer Array. Initialize it to point to the Data Array in such a way that, after being initialized, each element of the Pointer Array should point to the element in Data Array that has the same index. (This is illustrated in the first picture above.) 3) Sort the Pointer Array by using a modified version of the Bubble Sort algorithm provided. After sorting, pointerArr[0] should point to the smallest element in Data Array, pointerArr[1] should point to the second smallest element, and so forth. 4) Print out the data set in its original order (by traversing the Data Array) and in sorted order (by traversing the Pointer Array) Functional Requirements: You will need to write the following functions besides main(): 1) A swap() function. When called on two pointer arguments, this function should swap the values of the pointer arguments. 2) A sorting function. This function should implement the Bubble Sort (or some other common sorting algorithm) on the Pointer Array. Note that we are not sorting the Data Array in this problem, only the Pointer Array. Therefore, the pseudocode for the Bubble Sort given above will have to be modified to work on pointers. Furthermore, the sorting will be done according to the values the pointers are pointing to. Referring back to Bubble Sort, if we are comparing the values pointed to in one adjacent pointer element to another, and the value pointed to is smaller in the right hand element than the left, then we swap the pointers, not the values in the Data Array. 3) A display function for the Data Array. This function should display the data in the Data Array, 10 numbers per line in a 6 byte field. 4) A display function for the Pointer Array. This function should display the data pointed to in the Pointer Array, 10 numbers per line in a 6 byte field. Note that this function does not display addresses. It should display the integers found in the data set, but in sorted order. PseudoCode for main() function: Your main() function could look something like this: create and initialize the data array create and initialize the pointer array call the sorting function to sort the pointer array display prompt (Now displaying data in the original order) call the display function that displays the data in the original order display prompt (Now displaying data in sorted order) call the display function that displays the data in sorted order. For this assignment, you can develop your own prototypes for these functions. Suggestions for implementation Until you get used to them, pointers can be very confusing to work with. Therefore, it is very important, in this project especially, to implement your final solution one piece at a time. Dont try to write the whole thing at once. It is much better to work on one function at a time and thoroughly debug it before moving on to the next one. I suggest implementing your solutions as follows: 1) First initialize your main array (Data Array) with the data from eLearning. This contains 150 integers between 0 and 3000. 2) Then implement the function that prints out the data in the Data Array. Set it up to print 10 numbers per line, each number in a 6 byte field. Use it to test that the Data Array was initialized properly. Dont do anything else until this function is written and debugged. 3) Then set up the Pointer Array and initialize it as described above. 4) Then implement the display function that prints out the data from the Pointer Array. Use it to test the initialization of the pointer array. At this point, the data should display in the same order as in the original array. Dont do anything else until this function is written and debugged. 5) Then write the swap() function that swaps two int pointers. Test it by using a small driver program as follows: int x=5, y=10; int * xPtr = &x; int * yPtr = &y; printf (Address of x = %p; Address of y = %p , xPtr, yPtr); swap (&xPtr, &yPtr); printf (Address of x = %p; Address of y = %p , xPtr, yPtr); If your code is working well, the addresses should be swapped. 6) Then implement the Bubble Sort algorithm using the modified sorting algorithm given above. It should use the swap() function described above to do its swapping. As you work, use the display function for the pointer array that you have already written in step 4 -- to check your work. 7) Once everything is working, set up the main() function to perform the tasks of the assignment.

I have tried to do this program but can't obtain the right output. I am in desperate need of help!

Explanation / Answer

#include<stdio.h>

void swap(int* a,int* b)//to swap values in array
{
int t;
t =*a;
*a = *b;
*b = t;
}
void sort(int* array, int count)//Buuble sort
{

int i, j;

for(i = 0; i < count-1; ++i){

for(j=0; j<count-1-i; ++j){

if(*(array+j) >*(array+j+1)){
swap((array+j),(array+(j+1)));

}
}
}
}

void DisplayDataArray(int array[], int count)//function to display data array
{
int c=0;
int i;
for ( i = 0; i < count; ++i)
{
if(c==10)
{
c=0;
printf(" "); }
else
{
printf("%d ",array[i]);
c++;
}
}
}

void DisplayDPointerArray(int* array, int count)//function to display pointer array
{
int c=0;int i;
for ( i = 0; i < count; ++i)
{
if(c==10)
{
c=0;
printf(" ");
}
else
{
printf("%d ",*array);
array++;
c++;
}
}
}

int main(int argc, char const *argv[])
{
int dataArray[150]={71, 1899, 272, 1694, 1697, 296, 722, 12, 2726, 1899,
1374, 1541, 1923, 1904, 1083, 1462, 2981, 1929, 304, 2550,
1059, 1860, 1963, 516, 647, 1607, 590, 157, 2351, 753,
2455, 349, 79, 1634, 368, 1992, 2401, 357, 1478, 1601,
239, 365, 2453, 2283, 2432, 1223, 2739, 2487, 2714, 1391,
1972, 2805, 1504, 413, 1647, 2750, 44, 64, 934, 1008,
1429, 1427, 315, 2499, 1620, 1816, 2441, 2557, 2188, 531,
1514, 2825, 449, 265, 2064, 1022, 34, 1864, 1861, 1516,
1465, 2327, 398, 2769, 563, 194, 429, 942, 1795, 223,
2406, 780, 780, 61, 133, 195, 495, 1774, 1934, 2171,
433, 1417, 292, 324, 2929, 1597, 1470, 764, 593, 891,
679, 47, 1778, 2532, 1862, 2636, 549, 2923, 2270, 1101,
1607, 2395, 726, 1111, 892, 1988, 555, 379, 224, 298,
1660, 2203, 2385, 2159, 2574, 705, 2513, 1755, 313, 173,
148, 2449, 259, 1006, 1221, 2259, 2020, 1484, 2717, 2400};//initialise data array
int *pointerArray[150];
int count=150;
int i;
for ( i = 0; i < count; ++i)//initialise pointer array
{
pointerArray[i]=&dataArray[i];
}

printf("Unsorted Data array is : ");
DisplayDataArray(dataArray,count);

sort(dataArray,count);
printf(" Sorted Data array is : ");

DisplayDataArray(dataArray,count);
sort(*pointerArray,count);
printf(" Sorted Pointer array is : ");

DisplayDataArray(*pointerArray,count);

return 0;
}

==========================================================

Output:

============================================================

Unsorted Data array is :

71 1899 272 1694 1697 296 722 12 2726 1899
1541 1923 1904 1083 1462 2981 1929 304 2550 1059
1963 516 647 1607 590 157 2351 753 2455 349
1634 368 1992 2401 357 1478 1601 239 365 2453
2432 1223 2739 2487 2714 1391 1972 2805 1504 413
2750 44 64 934 1008 1429 1427 315 2499 1620
2441 2557 2188 531 1514 2825 449 265 2064 1022
1864 1861 1516 1465 2327 398 2769 563 194 429
1795 223 2406 780 780 61 133 195 495 1774
2171 433 1417 292 324 2929 1597 1470 764 593
679 47 1778 2532 1862 2636 549 2923 2270 1101
2395 726 1111 892 1988 555 379 224 298 1660
2385 2159 2574 705 2513 1755 313 173 148 2449
1006 1221 2259 2020 1484 2717 2400

Sorted Data array is :

12 34 44 47 61 64 71 79 133 148
173 194 195 223 224 239 259 265 272 292
298 304 313 315 324 349 357 365 368 379
413 429 433 449 495 516 531 549 555 563
593 647 679 705 722 726 753 764 780 780
892 934 942 1006 1008 1022 1059 1083 1101 1111
1223 1374 1391 1417 1427 1429 1462 1465 1470 1478
1504 1514 1516 1541 1597 1601 1607 1607 1620 1634
1660 1694 1697 1755 1774 1778 1795 1816 1860 1861
1864 1899 1899 1904 1923 1929 1934 1963 1972 1988
2020 2064 2159 2171 2188 2203 2259 2270 2283 2327
2385 2395 2400 2401 2406 2432 2441 2449 2453 2455
2499 2513 2532 2550 2557 2574 2636 2714 2717 2726
2750 2769 2805 2825 2923 2929 2981

Sorted Pointer array is :

Navigate

For our human eyes, as color of the visible light changes from Red to Violet, wh

For our last class, we read and discussed several papers focused on understandin

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

For our input into this problem let\'s use the first 150 elements of the array H

Question

Explanation / Answer

Related Questions

Navigate