DataStructures/sorting_integers.c at main · PawanKalyanV/DataStructures · GitHub

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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90

/* sort array of integers */

#include<stdio.h>

int sequential_sort (int *array, int size)
{
    int i, j, temp;

    for (i=0; i <= size-1; i++) {

     for (j=0; j <= size-1; j++) {

        if (array[j] > array[j+1]) {

         temp = array[j];

         array[j] = array[j+1];

         array[j+1] = temp;

        }
     }
    }
}

int selection_sort (int *array, int size)
{
    int i, j, temp;

    for (i=0; i <= size-1; i++) {

      for (j=i+1; j <= size-1; j++) {

        if (array[i] > array[j]) {

          temp = array[i];

          array[i] = array[j];

          array[j] = temp;
      }
     }
    }
}
int bubble_sort(int *array, int size)
{
    int i, j, temp;

    for (i=0; i <= size-1; i++) {

     for (j=0; j <= size-1; j++) {

       if (array[j] > array[j+1]) {

         temp = array[j];

         array[j] = array[j+1];

         array[j+1] = temp;

       }
     }
    }
}


int main()
{
    int n=5;

    int a[5] = {64, 25, 12, 11, 22};

    int exp[5] = {11, 12, 22, 25, 64};

    sequential_sort (a, 5);

    selection_sort (a, 5);

    bubble_sort (a, 5);

    for (int i=0; i < n; i++ ) {

      if (a[i] != exp[i]) {

        printf("\nThe elements are not sorted\n");

      }
    }
}