Contact Learn C
Copy

Program 285: Bubble Sort using Recursion

Program 285: Bubble Sort using Recursion
#include<stdio.h>
void BubbleSortRecursion(int a[],int num);
main()
{
int i,j,num,temp;
printf("Enter number of elements\n");
scanf("%d",&num);
int a[num];
printf("Enter numbers\n");
for(i=0;i<num;i++)
{
 scanf("%d",&a[i]);
}

BubbleSortRecursion(a,num);

printf("Ascending oreder of given numbers is\n");

for(i=0;i<num;i++)
{
 printf("%d\n",a[i]);
}

}

void BubbleSortRecursion(int a[],int num)
{
 int i,j,temp;
 i=num;
 if(i>0)
     {
       for(j=0;j<num-1;j++)
       {
         if(a[j]>a[j+1])
          {
            temp=a[j];
            a[j]=a[j+1];
            a[j+1]=temp;
          }
        }
        BubbleSortRecursion(a,num-1);
      }
      else
      {
       return;
      }
}
Explanation:

//Coming Soon

Output:
Bubble Sort using Recursion






1 comment:

  1. can't we have both reading and printing calling functions in the same program?

    ReplyDelete

Donate

Download App and Learn when ever you want

Get it on PlayStore
Get it on Amazon App Store
Get it on Aptoide