OOP/OOP-6-selectionsort.cpp at main · Avadhut-Shedage/OOP · 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
#include <iostream>
using namespace std;
int n;
#define size 10

template <class T>

void sel(T A[size])
{
    int i, j, min;
    T temp;
    for (i = 0; i < n - 1; i++)
    {
        min = i;
        for (j = i + 1; j < n; j++)
        {
            if (A[j] < A[min])
                min = j;
        }
        temp = A[i];
        A[i] = A[min];
        A[min] = temp;
    }
    cout << "\nSorted array:";
    for (i = 0; i < n; i++)
    {
        cout << " " << A[i];
    }
}

int main()
{
    int A[size];
    float B[size];
    int i;

    cout << "\nEnter total no of int elements:";
    cin >> n;
    cout << "\nEnter int elements:";
    for (i = 0; i < n; i++)
    {
        cin >> A[i];
    }
    sel(A);

    cout << "\nEnter total no of float elements:";
    cin >> n;
    cout << "\nEnter float elements:";
    for (i = 0; i < n; i++)
    {
        cin >> B[i];
    }
    sel(B);
}