Question

2. Using Pointers and Arrays 2.1 Write a function bubblesort which will accept an array of double precision floating point numbers of length N and sort the array. Ref: https://en.wikipedia.org/wiki/Bubble_sort (I can verify this is accurate) 2.2 Write a program which exercises the bubblesort. For a good test, the program should have more than 20 values.

Program must be in C language and MUST be able to run on visual studio

Answer 1

#include <stdio.h>
void bubbleSort(double a[], int n) {

double temp = 0;
int i,j;
for(i=0; i < n; i++){
for(j=1; j < (n-i); j++){

if(a[j-1] > a[j]){
//swap the elements!
temp = a[j-1];
a[j-1] = a[j];
a[j] = temp;
}

}
}

}
int main()
{
  
int i;
double a[20]={11,2,3,5,4,6,16,14,18,19,20,10,7,9,8,12,13,15,17,55};
printf("Array elements before sorting: \n");
for(i=0;i<20;i++){
printf("%lf ", a[i]);
}
printf("\n");
bubbleSort(a, 20);
printf("Array elements after sorting: \n");
for(i=0;i<20;i++){
printf("%lf ", a[i]);
}
printf("\n");

return 0;
}

Output:

$gcc -o main *.c
$main
Array elements before sorting: 
11.000000 2.000000 3.000000 5.000000 4.000000 6.000000 16.000000 14.000000 18.000000 19.000000 20.000000 10.000000 7.000000 9.000000 8.000000 12.000000 13.000000 15.000000 17.000000 55.000000 
Array elements after sorting: 
2.000000 3.000000 4.000000 5.000000 6.000000 7.000000 8.000000 9.000000 10.000000 11.000000 12.000000 13.000000 14.000000 15.000000 16.000000 17.000000 18.000000 19.000000 20.000000 55.000000