Question

C Programming, part B:

(1 point) Write a second program (Program B) that builds a contiguous list (i.e., array- based), also of 100 elements (cells), each containing a random integer between 0 and 99. You encouraged to re-use as much code from Program A as you wish (this is called code re- sue and it is a good thing). This program must: 1) Build the contiguous list (i.e., the properly populated array) 2) Print out the contents of the list. Use the same output format you used for part A.2 B. except call it a "cell" and not a "node 3) Sort the list using the insertsort algorithm. 4) Print out the list automatically after it has been sorted. Use the same printout format as in part B.2 above.

Answer 1

/**C program that prints the elements of random
array before and after sorting usign insertion sort
and print the output on console.*/
//main.c
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<conio.h>
//function prototypes
void fill(int arr[], int SIZE);
void display(int arr[], int SIZE);
void insertionSort(int arr[], int SIZE);
// start of main method
int main()
{

   const int SIZE=100;
   int randarr[SIZE];
   //callgin the fill method
   fill(randarr,SIZE);
   printf("Before sorting\n");

   //calling display method
   display(randarr,SIZE);
   //calling insertionSort method
   insertionSort(randarr,SIZE);
   //calling display method
   printf("After sorting\n");
   display(randarr,SIZE);

   getch();
   return 0;
}
//Fill the random numbers in a range of 0 to 99
void fill(int arr[], int SIZE)
{
   //seed of time to generate
   //random numbers
   srand(time_t(0));
   //fill random numbers in
   //a range of 0 to 99
   for(int i=0;i<SIZE;i++)
       arr[i]=rand()%100;
}
//Display elements on the console
void display(int arr[], int SIZE)
{
   for(int i=0;i<SIZE;i++)
       printf("cell [%d] = %d\n",i,arr[i]);
}
//Insertion sort method that sorts the elements
//in the array in ascending order
void insertionSort(int arr[], int SIZE)
{
   int i, key, j;
   for (i = 1; i < SIZE; i++)
   {
       key = arr[i];
       j = i-1;
       /*
       Move elements of arr[0..i-1], that are
       greater than key, to one position ahead
       of their current position */
       while (arr[j] > key &&j >= 0)
       {
           arr[j+1] = arr[j];
           j = j-1;
       }
       arr[j+1] = key;
   }
}

Sample Output:

Before sorting cell [0] = 38 cell [1] 19 cell [2] = 38 cell [3]37 cell [4] 55 cell [5] = 97 cell [6] = 65 cell [7] 85 cell [8] = 50 cell [9] = 12 cell [10] = 53 cell [11] 0 се cell [12]-42 cell [13]81 cell [14]37 cell [15] = 21 cell [16] = 45 cell [17] = 85 cell [18] = 97 cell [19] 80 cell [2e]76 cell [21] = 91 cell [22] 55 cell [23] = 6 cell [24]57 cell [25] 23 cell [26]-81 cell [27] 40 cell [28] 25 cell [29]78 cell [30] = 46 cell [31] 90 cell [32140 cell [33] = 87 cell [34] 7 cell [35] 37 cell [36] = 11 cell [37]-17 cell [38] = 56 cell [39] = 67 cell [40] = 33 cell [41] = 78 cell [42123

After sorting cell [0] = 0 cell [1] = 2 cell [2] = 3 cell [3] = 4 cell [4] 4 cell [5] = 4 cell [6] = 4 cell [7] = 4 cell [8] 5 cell [9] = 6 cell [10] = 7 cell [11] = 11 cell [12] = 11 cell [13] 12 cell [14] = 12 cell [15] 13 cell [16] = 14 cell [17] = 17 cell [18] = 19 cell [19] = 19 cell [20] = 20 cell [21] = 21 cell [22] = 23 cell [23] 23 cell [24] = 23 cell [25] = 24 cell [26] = 25 cell [27] 28 cell [28] 29 cell [29] = 29 cell [30] = 30 cell [31] = 31 cell [32] = 33 cell [33] 33 cell [34] = 35 cell [35] = 36 cell [36] = 37 cell [37] = 37 cell [38] = 37 cell [39] = 37 cell [40] 37 cell [41] = 38