Sorting-Algorithms/SelectionSort.cpp at master · bishworup11/Sorting-Algorithms · 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
#include<bits/stdc++.h>
using namespace std;

void selectionSort(int arr[], int n )
{
    int i , j, min;

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

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

            if (arr[min] > arr[j])
            {
                min = j;


            }
        }

        int temp;
        temp = arr[i];
        arr[i] = arr[min];
        arr[min] = temp;
    }


}

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

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

        cout << arr[i] << " ";
    }
}

main()
{
    int n;

    printf("input the array length\n");

    cin >> n;
    int ar[n];
    for (int i = 0; i < n; i++)
    {

        cin >> ar[i];
    }

    selectionSort(ar, n);

    display(ar, n);


}