Data-Structure-Algorithm/Bubblesort.c at master · tanmay-563/Data-Structure-Algorithm · 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
#include <stdio.h>
#include <stdlib.h>
void traverse(int*a, int n){
    for (int i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n");
}
void bubblesort(int *a, int n){
    int temp;
    for (int i = 0; i < n-1 ; i++)
    {
        for (int j = 0; j < n-i-1 ; j++){
            if(a[j]>a[j+1]){
                temp = a[j];
                a[j]= a[j+1];
                a[j+1]= temp;
            }
        }

    }

}
void bubblesortadaptive(int *a, int n){
    int temp;
    int flag = 0;
    for (int i = 0; i < n-1 ; i++)
    {
        int flag = 1;
        for (int j = 0; j < n-i-1 ; j++){
            if(a[j]>a[j+1]){
                temp = a[j];
                a[j]= a[j+1];
                a[j+1]= temp;
                int flag = 0;
            }
        }
        if(flag){
            return;
        }

    }

}
int main(){
    int a[]= {23,54,67,89,43,21,88,90};
    int n = 8;
    traverse(a,n);
    bubblesortadaptive(a,n);
    traverse(a,n);
    return 0;
}