Skip to main content

Sort the given set of N numbers using Bubble sort Program and Algorithm Computer Science Engineering VTU

Bubble sort
#include<stdio.h>
int main()
{
    int i,j,n,a[100],temp;
    printf("enter the number of elements");
    scanf("%d",&n);
    printf("enter the elements\n");
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    for(i=0;i<n-1;i++)
{
    for(j=0;j<n-i-1;j++)
{
    if(a[j]>a[j+1])
{
    temp=a[j];
    a[j]=a[j+1];
    a[j+1]=temp;
}
}
}
printf("sorted arry\n");
for(i=0;i<n;i++)
printf("%d\t",a[i]);
return 0;
}
Algorithm: BubbleSort
Start

read n

for i= 0 to n-1 

read a[i] 

for i=0 to n-1 

for j=0 to n-i-1 

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

temp = a[j]

a[j] = a[j+1]

a[j+1] = temp 

for i=0 to n-1

print a[i]

Stop

Comments

Popular posts from this blog

Write functions to implement string operations such as compare, concatenate, string length. Convince the parameter passing techniques Program and Algorithm Computer Science Engineering VTU

STRINGconcatenation #include<stdio.h> #include<stdlib.h> int length (char str[]); int compare (char str1[],char str2[]); void concatenate (char str1[],char str2[]); void main() { char str1[30],str2[30]; int choice,a,i,j; printf("enter 1-string comparision\n"); printf("enter 2-string length\n"); printf("enter 3-string concatenation\n"); printf("enter 4-exit\n"); scanf("%d",&choice); switch(choice) { case 1:printf("enter string 1\n"); scanf("%s",str1); printf("enter string 2\n"); scanf("%s",str2); a=compare(str1,str2); if(a==0) { printf("%s and%s are identical\n",str1,str2); } else { printf("%s and%s are not identical\n",str1,str2); } break; ...

Select the option that is most nearly OPPOSITE in meaning to the word or phrase is given in bold. Birds are quarantined to prevent the spread of bird flu.

Select the option that is most nearly OPPOSITE in meaning to the word or phrase is given in bold. Birds are  quarantined  to prevent the spread of bird flu. immunized butchered secluded CORRECT mingled