Programming-Codes/program13.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
// Insertion sort = you should use this algrithm because it is adaptable and stable algorithm


#include<iostream>
using namespace std;


void InsertionSortAscending(int arr[],int n);


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


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


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


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

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

            else{
                break;
            }
        }
        arr[j+1] = temp;
    }

}


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;
}