Search element in an Array through Bubble sort technic.
#include<stdio.h>
#include<conio.h>
void bsort(int *num, int n);
int main()
{
int i,num[5];
printf("Enter 5 number-\n");
for(i=0;i<5;i++)
scanf("%d",&num[i]);
bsort(num,5);
}
void bsort(int *num,int n)
{
int i,j,t;
for(i=0;j<n;i++)
{
for(j=i;j<n-1;j++)
{
if(num[i]<num[j+1])
{
t=num[i];
num[i]=num[j+1];
num[j+1]=t;
}
}
}
printf("select element are...\n");
for(i=0;i<n;i++)
printf("%d\n",num[i]);
getch();
//return 0;
}
// ============== Output after run on DEV C++ compiler.
#include<stdio.h>
#include<conio.h>
void bsort(int *num, int n);
int main()
{
int i,num[5];
printf("Enter 5 number-\n");
for(i=0;i<5;i++)
scanf("%d",&num[i]);
bsort(num,5);
}
void bsort(int *num,int n)
{
int i,j,t;
for(i=0;j<n;i++)
{
for(j=i;j<n-1;j++)
{
if(num[i]<num[j+1])
{
t=num[i];
num[i]=num[j+1];
num[j+1]=t;
}
}
}
printf("select element are...\n");
for(i=0;i<n;i++)
printf("%d\n",num[i]);
getch();
//return 0;
}
// ============== Output after run on DEV C++ compiler.


No comments:
Post a Comment
Note: only a member of this blog may post a comment.