Scribd
Upload
2 views

functiontemp_5

The document presents a C++ program that implements a function template for selection sort, allowing the sorting of both integer and float arrays. It explains the advantages, such as reusability and simplicity, as well as the disadvantages, including time complexity of O(n²). The program is suitable for small datasets and educational purposes but is not efficient for larger datasets.

Uploaded by

yashtamboli2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
2 views

functiontemp_5

The document presents a C++ program that implements a function template for selection sort, allowing the sorting of both integer and float arrays. It explains the advantages, such as reusability and simplicity, as well as the disadvantages, including time complexity of O(n²). The program is suitable for small datasets and educational purposes but is not efficient for larger datasets.

Uploaded by

yashtamboli2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

/*

Write a function template for selection sort that inputs, sorts and outputs an
integer array and a float
array.
*/

#include<iostream>
using namespace std;
int n;
#define size 10
template<class T>
void sel(T A[size]) // sel function is called to sort the integer array.
{
int i, j, min;
T temp; /// This declares a temporary variable of type T to
hold values during the swap operation.
for(i = 0; i < n - 1; i++)
{
min = i;
for(j = i + 1; j < n; j++) // searches for the minimum element in the
remaining unsorted part of the array.
{
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);
}

/*
Theory
The program demonstrates function templates in C++ to implement selection sort for
sorting integer and float arrays, using the same function for different data types.

Definition
Function Template: A generic function that works with any data type.
Selection Sort: A sorting algorithm that repeatedly selects the smallest element
and places it in its correct position.
Template Class T: A placeholder for data types like integers and floats.

Algorithm
Define a template function sel() to sort any array type.
Input integer and float arrays.
Use selection sort to sort the arrays.
Print the sorted arrays.

Advantages
Reusability: The template allows sorting of both integers and floats using one
function.
Simplicity: Easy to implement and understand.
In-place Sorting: No extra memory needed apart from the array.

Disadvantages
Time Complexity: O(n²), inefficient for large datasets.
No Optimization: Doesn’t improve performance for partially sorted arrays.

Application
Small Data Sets: Used when sorting small datasets or for educational purposes.
Embedded Systems: Suitable for environments with limited memory.

Conclusion
The program demonstrates function templates with selection sort to sort both
integer and float arrays. While simple and useful for small datasets, it’s not
efficient for large data due to its O(n²) time complexity.
*/

You might also like