BogoSort in C - Sanfoundry

This C Program Implements BogoSort in an Integer Array.

Here is source code of the C Program to Implement BogoSort in an Integer Array. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C Program to Implement BogoSort in an Integer Array

```
 */
```
```
#include <stdio.h>
```
```
#include <stdlib.h>
```
```
 
```
```
#define size 7
```
```
/* Function Prototypes */
```
```
 
```
```
int is_sorted(int *, int);
```
```
void shuffle(int *, int); 
```
```
void bogosort(int *, int);
```
```
 
```
```
int main()
```
```
{
```
```
    int numbers[size];
```
```
    int i;
```
```
 
```

    printf("Enter the elements of array:");

```
    for (i = 0; i < size;i++)
```
```
    {
```
```
        scanf("%d", &numbers[i]);
```
```
    }
```
```
    bogosort(numbers, size);
```

    printf("The array after sorting is:");

```
    for (i = 0;i < size;i++)
```
```
    {
```
```
        printf("%d\n", numbers[i]);
```
```
    }
```
```
    printf("\n");
```
```
}
```
```
 
```

/* Code to check if the array is sorted or not */

```
int is_sorted(int *a, int n)
```
```
{
```
```
    while (--n >= 1)
```
```
    {
```
```
        if (a[n] < a[n - 1])
```
```
        {
```
```
            return 0;
```
```
          }
```
```
    }
```
```
      return 1;
```
```
}
```
```
 
```

/* Code to shuffle the array elements */

```
void shuffle(int *a, int n)
```
```
{
```
```
    int i, t, temp;
```
```
    for (i = 0;i < n;i++)
```
```
    {
```
```
        t = a[i];
```

        temp = rand() % n;    /* Shuffles the given array using Random function */

```
        a[i] = a[temp];
```
```
        a[temp] = t;
```
```
    }
```
```
}
```
```
 
```

/* Code to check if the array is sorted or not and if not sorted calls the shuffle function to shuffle the array elements */

```
void bogosort(int *a, int n)
```
```
{
```
```
    while (!is_sorted(a, n))
```
```
    {
```
```
        shuffle(a, n);
```
```
    }
```
```
}
```

$ cc bogo_sort.c
Average case:
$ a.out
Enter the elements of array:56
34
96
26
08
87
36
The array after sorting is:8
26
34
36
56
87
96
 
Best case:
$ a.out
Enter the elements of array:12
23
34
45
56
67
78
The array after sorting is:12
23
34
45
56
67
78
 
Worst case:
$ a.out
Enter the elements of array:984
38
983
389
37
596
483
The array after sorting is:37
38
389
483
596
983
984