Programming-Codes/program12.cpp at master · HarshTanwar143/Programming-Codes · 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
// Bubble Sort  = it is a stable algorithm


#include<iostream>
using namespace std;


void BubbleSortAscending(int arr[],int n){

    for(int i = 1;i<n;i++){
        bool swapped = false;
        for(int j = 0;j<n-i;j++){
            if (arr[j]>arr[j+1]){
                swap(arr[j],arr[j+1]);
                swapped = true;
            }
        }
        if (swapped == false){
            break;
        }
    }

}


int BubbleSortDecending(int arr[],int n );


int printelements(int arr[],int n){
    for(int j = 0;j<n;j++){
        cout<<arr[j]<<" ";
    }
    cout<<endl;
}


int setelements(int arr[],int n){
    for(int i = 0;i <n;i++){
        cin>>arr[i];
    }
    return 0;
}


int main(){
    int n ;
    cout<<"Enter how many elements do you want to enter in an arry : ";
    cin>>n;
    int arr[n];
    setelements(arr,n);
    BubbleSortAscending(arr,n);
    printelements(arr,n);
    BubbleSortDecending(arr,n);
    printelements(arr,n);
    return 0;
}


int BubbleSortDecending(int arr[],int n ){

    for(int i = 1;i<n;i++){
        bool swapped = false;
        for(int j = 0;j<n-i;j++){
            if(arr[j]<arr[j+1]){
                swap(arr[j],arr[j+1]);
                swapped = true;
            }
        }
        if (swapped == false){
            break;
        }
    }

}