ALLInterview.com :: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Google
   
 
Categories >> Software >> Operating Systems >> Data Structures
 
 


 

 
Question Write programs for Bubble Sort, Quick sort
 Question Asked At :: Cognizent, Heap Sort
 Question Submitted By :: guest
I also faced this Question!!     Answer Posted By  
 
Answer
Program for Bubble sort*/
#include<stdio.h>
#include<conio.h>
#define max 20
void insert(int [],int);
void display(int [],int);
void sort(int [],int);
void main()
{
int a[max],n;
clrscr();
printf("\n \t Enter the size of array < %d--->",max);
scanf("%d",&n);
insert(a,n);
printf("\n \t Elements before sorting");
display(a,n);
sort(a,n);
printf("\n \t Elements after sorting");
display(a,n);
}
void insert(int a[],int n)
{
int i;
printf("\n \t Enter %d elements-->",n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
}
void display(int a[],int n)
{
int i;
for(i=0;i<n;i++)
printf("\n %d",a[i]);
}
void sort(int a[],int n)
{
int i,j,temp;
for(i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j]>a[j+1])as
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
} }
}}

Enter the size of array < 20---->5

Enter 5 elements--->45
3
78
43
21

Elements before sorting
45
3
78
43
21
Elements after sorting
3
21
43
45
78
Is This Answer Correct ?    23 Yes 12 No


 
  Naveen
 
View All Answers
 
 
 
 
 


   
Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
   
Copyright 2013  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  KalAajKal.com