//This program uses the MinSort and BubbleSort algorithms.
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
void Randomizer();
void BubbleSort(short[], short[]);
void MinSort(short[], short[]);
void main()
{
printf("****\nMain\n****\n\n"

;
Randomizer();
}
void Randomizer()
{
printf("**********\nRandomizer\n**********\n\n"

;
short array1[10000], array2[10000];
short y, x = 10000;
for(y=0;y<x;y++)
{
array1[y] = rand();
array2[y] = rand();
}
BubbleSort(array1, array2);
MinSort(array1, array2);
}
void BubbleSort(short bubarray1[],short bubarray2[])
{
printf("**********\nBubbleSort\n**********\n\n"

;
short outer, inner, temp1, temp2, end=10000;
for(outer=0; outer<end; outer++)
{
for(inner=outer+1; inner>0; inner--)
{
if(bubarray1[inner]<bubarray1[inner-1])
{
temp1 = bubarray1[inner];
bubarray1[inner] = bubarray1[inner-1];
bubarray1[inner-1] = temp1;
}
if(bubarray2[inner]<bubarray2[inner-1])
{
temp2 = bubarray2[inner];
bubarray2[inner] = array2[inner-1];
bubarray2[inner-1] = temp2;
}
}
}
}
void MinSort(short minarray1[],short minarray2[])
{
printf("*******\nMinSort\n*******\n\n"

;
int temp_index1=1, temp_index2=1, min1, min2, x=10000, y, z;
for(y=0; y<x; y++)
{
min1 = minarray1[y];
min2 = minarray2[y];
for(z=y; z<x; z++)
{
if(minarray1[z]<min1)
{
temp_index1 = z;
min1 = minarray1[z];
//oddly, it always craps out before printing this statement.
printf("minarray1 switch\n"

;
}
if(minarray2[z]<min1)
{
temp_index2 = z;
min2 = minarray2[z];
}
}
minarray1[temp_index1] = minarray1[y];
minarray1[y] = min1;
minarray2[temp_index2] = minarray2[y];
minarray2[y] = min1;
}
}