//bogo.c, a bogosort implementation for Data Structures
//By Brandon Kennedy
//compile: gcc -o bogo bogo.c
//run ./bogo
#include<stdio.h>
#include<stdlib.h>

int main()
{
        int size=10;
        int tmp=0,i,one=0,two=0;
        int value[size];
        char sort = 'n';
        for(i=0;i<size;i++)
        {
                printf("enter a value for slot %d: ", i);
                scanf("%d", &value[i]);
        }
        while(sort == 'n')
        {
                sort = 'y';
                one = (rand() % size);
                two = (rand() % size);
                tmp = value[one];
                value[one] = value[two];
                value[two] = tmp;
                for(i=0;i<size;i++)
                {
                        if(value[i] > value[i+1])
                                sort = 'n';
                }
        }
        for(i=0;i<size;i++)
                printf(". %d ", value[i]);
        return 0;
}