1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
|
void sort(int a1[]){
int temporary;
int x, z;
int dup[11];
for(x = 1; x < 12; x++)
{
for(z = 12 - 1; z >= x; z--)
{
if(a1[z] > a1[z-1])
{
temporary = a1[z];
a1[z] = a1[z-1];
a1[z - 1] = temporary;
}
}
}
x = 0;
for(z = 0; z < 12; z++)
{
if(a1[z] = a1[z+1]);
{
if(a1[z+1] = dup[x]);
else
{
dup[x] = a1[z];
x + 1;
}
}
}
printf("Duplicate numbers: %d, %d, %d, %d, %d, %d, %d, %d, %d, %d, %d", dup[0], dup[1], dup[2], dup[3], dup[4], dup[5], dup[6], dup[7], dup[8], dup[9], dup[10]);
return;
}
|