Question

//bubble sort implementation// Fig 6.15 with simplified convention for the for loop.

#define _CRT_SECURE_NO_WARNINGS //for windows os only
#include <stdio.h>
#include <stdlib.h>

// Fig. 6.15: fig06_15.c
// Sorting an array's values into ascending order.
#include <stdio.h>
#define SIZE 10

// function main begins program execution
int main(void)
{
   // initialize a
   int a[SIZE] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 };

   printf("Data items in original order");
   // output original array
   for (int i = 0; i < SIZE; i++)
   {
       printf("%4d", a[i]);
   }
   // bubble sort
   // loop to control number of passes, we pass through this loops how many times?
   for (int pass = 1; pass < SIZE; pass++)
   {
       // loop to control number of comparisons per pass
       for (int i = 0; i < SIZE - 1; i++)
       {
           // compare adjacent elements and swap them if first
           // element is greater than second element

   //int a[SIZE] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 };
           if (a[i] > a[i + 1])
           {
               int hold = a[i];
               a[i] = a[i + 1];
               a[i + 1] = hold;
           }
       }
   }

   printf("\nData items in ascending order");
   // output sorted array
   for (int i = 0; i < SIZE; i++)
   {
       printf("%4d", a[i]);
   }

   system("pause");
}

Create a new project and copy/paste the c code from bubblesort.txt. ==HERE==>  bubblesort.txt

Note that you will need to format the text in some places so it presents nicely.

Please implement the following requirements:

1.) Modify the array to store 15 values. Currently, the array stores 10 values.

2.) Ask the user to input those additional five values and store them in the a array.

3.) Print the entire contents of the array (with the additional five values) to the screen. Please modify the for loop accordingly to enable this change.

4.) Now move the bubble sort part of the code into a new function that you will create called genBubblesort. Please refer to the lecture notes and Chapter six for how arrays are treated as input to a function. Print the results of the array program from within the function so there will be nothing to return from this function.

5.) The bubble sort part of the program currently sorts in ascending order. Please modify it to sort the values in descending order.

Total Points (24 points)

Grading Criteria:

1.) Define variables and use descriptive names (4 points)

2.) Properly comment your code and use good programming style (4 points)

3.) Make sure your program compiles ( 8 points)

4.) Make sure your program is correct (8 points)

Answer 1

//bubble sort implementation with new project

#define _CRT_SECURE_NO_WARNINGS //for windows os only
#include <stdio.h>
#include <stdlib.h>

// Sorting an array's values into descending order.
#include <stdio.h>
#define SIZE 15

//Creating new for Bubble sorting

void genBubblesort(int a[]);

// function main begins program execution
int main(void)
{
   // initialize a
   int a[SIZE] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37, 16, 60, 53, 96, 43 };

   printf("Data items in original order");
   // output original array
   for (int i = 0; i < SIZE; i++)
   {
       printf("%4d", a[i]);
   }
   // bubble sort
// Calling function

genBubblesort(a);

   system("pause");
}
  

void genBubblesort(int a[])

{

// bubble sort
   // loop to control number of passes, we pass through this loops how many times?

for (int pass = 0; pass < SIZE; pass++)
   {
       // loop to control number of comparisons per pass
       for (int i = pass + 1; i < SIZE ; i++)
       {
           // compare adjacent elements and swap them if first
//int a[SIZE] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37, 16, 60, 53, 96, 43 };

           if (a[pass] < a[i])
           {
               int hold = a[pass];
               a[pass] = a[i];
               a[i] = hold;
           }
       }
   }

   printf("\nData items in descending order");
   // output sorted array
   for (int i = 0; i < SIZE; i++)
   {
       printf("%4d", a[i]);
   }

}