44 lines
913 B
C++
44 lines
913 B
C++
|
Applying Generic Functions: A Generic Bubble Sort
|
||
|
|
#include <iostream>
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
template <class X> void bubble(
|
||
|
|
X *items, // pointer to array to be sorted
|
||
|
|
int count) // number of items in array
|
||
|
|
{
|
||
|
|
register int a, b;
|
||
|
|
X t;
|
||
|
|
|
||
|
|
for(a=1; a<count; a++)
|
||
|
|
for(b=count-1; b>=a; b--)
|
||
|
|
if(items[b-1] > items[b]) {
|
||
|
|
// exchange elements
|
||
|
|
t = items[b-1];
|
||
|
|
items[b-1] = items[b];
|
||
|
|
items[b] = t;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int iarray[7] = {7, 5, 4, 3, 9, 8, 6};
|
||
|
|
double darray[5] = {4.3, 2.5, -0.9, 100.2, 3.0};
|
||
|
|
|
||
|
|
for(int i=0; i<7; i++)
|
||
|
|
cout << iarray[i] << endl;
|
||
|
|
|
||
|
|
for(int i=0; i<5; i++)
|
||
|
|
cout << darray[i] << endl;
|
||
|
|
|
||
|
|
bubble(iarray, 7);
|
||
|
|
bubble(darray, 5);
|
||
|
|
|
||
|
|
for(int i=0; i<7; i++)
|
||
|
|
cout << iarray[i] << endl;
|
||
|
|
|
||
|
|
for(int i=0; i<5; i++)
|
||
|
|
cout << darray[i] << endl;
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|