/**************************************************************
Author: Arun Vishnu M V
Web: www.arunmvishnu.com
Description: C++ Program for Bubble sort
***************************************************************/#include<iostream.h>#include<conio.h>void main(){int array[100],n,i,j,temp;
clrscr();cout<<"How many numbers--> ";cin>>n;cout<<"Enter "<<n<<" numbers\n";for(i=0;i<n;i++)cin>>array[i];for(i=0;i<n;i++){for(j=0;j<n-1;j++)if(array[j]>array[j+1]){
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;}}cout<<"\nArray is sorted in ascending order.\n";for(i=0;i<n;i++)cout<<array[i]<<" ";
getch();}
/**************************************************************
Author: Arun Vishnu M V
Web: www.arunmvishnu.com
Description: C++ Program for Bubble sort
***************************************************************/
#include<iostream.h>
#include<conio.h>
void main()
{
int array[100],n,i,j,temp;
clrscr();
cout<<"How many numbers--> ";
cin>>n;
cout<<"Enter "<<n<<" numbers\n";
for(i=0;i<n;i++)
cin>>array[i];
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++)
if(array[j]>array[j+1])
{
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
cout<<"\nArray is sorted in ascending order.\n";
for(i=0;i<n;i++)
cout<<array[i]<<" ";
getch();
}
Can u upload on Priority Queue ,Double Ended Queue ,Binary Search Tree ,Tree Traversal Techniques ,deleting a leaf node from binary search tree in C++ .
thank u.how create this programme with using read display function.
thanks for solving my problem that program is very hlpful for understanding the bubble sort
thank u so much… its a grt help for d beginners in cpp……..
Thanks for the Program. Its very helpful .
Can u upload on Priority Queue ,Double Ended Queue ,Binary Search Tree ,Tree Traversal Techniques ,deleting a leaf node from binary search tree in C++ .
Please help Me .
Thanks in Advance