balloon sort algorithm C++ implementation code-sorting array

Tue Feb 05, 2013 6:30 pm

balloon sort algorithm C++ implementation code
cpp code
void balloon()
{ int num, N[10], x, y, z,temp;
clrscr();
cout<<"How many number would you like to sort? ";
cin>>num;
cout<<"Input the "<<num<<" numbers:"<<endl;

for(x=0;x<num;x++)
cin>>N[x];

for(x=0;x<num;x++)
{
for(y=0;y<num-x;y++)
{ if(N[x] > N[x+y])
{ temp=N[x];
N[x] =N[x+y];
N[x+y]=temp;
}
}
cout<<"pass "<<x+1<<"] ";
for(z=0;z<num;z++)
{
cout<<setw(5)<<N[z];
}
cout<<endl;
}
}

  Related Posts  to : balloon sort algorithm C++ implementation code-sorting array
 Bubble Sort Algorithm Java Implementation Code-Sorting Array     -  
 quicksort algorithm implementation java code- array sorting     -  
 bidirectional bubble sort algorithm implementation java     -  
 Quicksort implementation C++ Code-Integers-Sorting     -  
 Sort strings java-Sorting Array of Strings     -  
 Incomplete code for array sorting and merging     -  
 How to write a code for sorting array of 100 number in C++     -  
 merge sort implementation in C++     -  
 AES -S-BOX Linear Algorithm implementation-substitution box     -  
 Array sort     -  

Topic Tags

C++ Sorting