Question

Introduction BUBBLE SORT: Step-by-step example Let us take the array of numbers "5 1 4 2 8", and sort the array from lowest number to greatest number using bubble sort. In each step, elements written in bold are being compared. Three passes will be required First Pass: ( 5 1 4 2 8 ) → ( 1 5 4 2 8 ). Here, algorithm compares the first two elements, swaps since 5 (15428)→(14528). Swap since 5 > 4 (14528)→(14258). Swap since 5 >2 1 4 2 5 8 ) → ( 1 4 2 5 8 ), Now, since these elements are already in order (8 > 5), algorithm does not swap them. Second Pass: (14258)→(14258) (14258)→(12458). Swap since 4 > 2 (12458)→(12458) (12458)→(12458) Now, the array is already sorted, but our algorithm does not know if it is completed. The algorithm needs one whole pass without any swap to know it is sorted Third Pass: (12458)→(12458) (12458)→(12458) (12458)→(12458) (12458)→(12458)

Answer 1

100% WORKING...

PROGRAM:::

#include<stdio.h>

void bubbleSort(int A[],int arraySize)

{

                int i,j;

                for(i=0;i<arraySize;i++)

                                for(j=0;j<arraySize-1;j++)

                                                if(A[j]>A[j+1])

                                                                swap(A+j,A+j+1);

}

void swap(int *a,int *b)

{

                int temp=*a;

                *a=*b;

                *b=temp;

}

void main()

{

                int array[100],n,i,j,swap;

                printf("Enter the no of elements ::");

                scanf("%d",&n);

                printf("Enter %d elements ::",n);

                for(i=0;i<n;i++)

                                scanf("%d",&array[i]);

                bubbleSort(array,n);

                printf("Sorted list in ascending order ::",n);

                for(i=0;i<n;i++)

                                printf("\n%d",array[i]);

                //below code is for the 2nd question

                int median;

                if(n%2==0)

                                median=( array[n/2]+array[n/2 -1] )/2;

                else

                                median=array[n/2];

                printf("\nMedian of the Array :: %d",median);

               

}

OUTPUT:::

null