Mega Code Archive
A Bubble sort
#include
#include
using namespace std;
int main()
{
int nums[10];
int a, b, t;
int size;
size = 10; // number of elements to sort
for(t=0; t=a; b--) {
if(nums[b-1] > nums[b]) { // if out of order
// exchange elements
t = nums[b-1];
nums[b-1] = nums[b];
nums[b] = t;
}
}
cout << "\nSorted array is:\n ";
for(t=0; t