Programming-Codes/program11.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
//Selection sort  = use this sorting when you have small size array , it is a stable algorithm


#include<iostream>
using namespace std;


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

    for(int i = 0; i<n-1;i++){
        int minindex = i;
        for(int j = i+1;j<n;j++){
            if (arr[minindex] > arr[j]){
                minindex = j;
            }
        }
        swap(arr[i],arr[minindex]);
    }

}


void SelectionSortDecending(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);
    SelectionSortAscending(arr,n);
    printelements(arr,n);
    SelectionSortDecending(arr,n);
    printelements(arr,n);
    return 0;
}


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

    for (int i = 0; i<n-1;i++){
        int maxindex = i;
        for (int j = i+1;j<n;j++){
            if (arr[maxindex] < arr[j]){
                maxindex = j;
            }
        }
        swap(arr[i],arr[maxindex]);
    }

}