Skip to main content

Write a program using function template that ask user to enter the 10 elements in the array of type int and float and display the five largest value in ascending order.

 Here's a program using function templates to find the five largest values in an array of integers or floats in ascending order:

#include <iostream>
#include <algorithm>
using namespace std;
template <typename T>

void findLargestValues(T arr[], int size, int n) {
    // sort the array in descending order
    sort(arr, arr + size, greater<T>());
    // print the largest n values in ascending order
    cout << "The " << n << " largest values are: ";
    for (int i = 0; i < n; i++) {
        cout << arr[size - i - 1] << " ";
    }
    cout << endl;
}
int main() {
    int intArr[10];
    float floatArr[10];
    // read integers from user input
    cout << "Enter 10 integers: ";
    for (int i = 0; i < 10; i++) {
        cin >> intArr[i];
    }
    // find the 5 largest integers
    findLargestValues(intArr, 10, 5);
    // read floats from user input
    cout << "Enter 10 floats: ";
    for (int i = 0; i < 10; i++) {
        cin >> floatArr[i];
    }
    // find the 5 largest floats
    findLargestValues(floatArr, 10, 5);
    return 0;
}

In this program, we define a function template findLargestValues that takes an array of type T, its size, and the number of largest values to find. The function first sorts the array in descending order using the sort function and greater comparator. It then prints the largest n values in ascending order using a loop.

In the main function, we declare two arrays intArr and floatArr of size 10 to store user input. We read integers and floats from user input using a loop and then call the findLargestValues function template twice, once for the intArr array and once for the floatArr array, to find the 5 largest values in each array.

Comments

Popular posts from this blog

Write a program using the algorithm count() to count how many elements in a container have a specified value.

 Here's an example program using the count() algorithm to count the number of occurrences of a specific value in a vector container: #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() {     vector<int> numbers = { 2, 5, 3, 7, 8, 5, 1, 5, 4 };          // count the number of occurrences of the value 5 in the vector     int count = count(numbers.begin(), numbers.end(), 5);          cout << "The number of occurrences of 5 in the vector is: " << count << endl;          return 0; } Output: The number of occurrences of 5 in the vector is: 3 Explanation: The program starts by creating a vector named numbers that contains several integer values. The count() algorithm is used to count the number of occurrences of the value 5 in the numbers vector. The function takes three arguments: the beginning and end iterators of...

What are Stub and Skeleton in Distributed Application? Explain its function with block diagram.

 Stub and Skeleton are two important components of distributed applications. A distributed application is a software system that runs on multiple computers connected through a network. It allows users to access resources and services on different computers as if they were on a local computer. In a distributed application, a client program on one computer sends a request to a server program on another computer. The server program processes the request and sends a response back to the client program. Stub and Skeleton help to facilitate this communication between the client and server programs. A Stub is a client-side proxy that represents the remote object on the client machine. It acts as a gateway for the client to communicate with the server. When a client invokes a method on the Stub, it marshals the arguments and sends them to the server over the network. The Stub then waits for the server to send a response. When the response is received, the Stub unmarshals the data and retur...

Write short notes on 1. polymorphism 2. applet vs Application 3. Marshalling and unmarshalling

 1. Polymorphism: Polymorphism is a concept in object-oriented programming (OOP) that refers to the ability of an object to take on multiple forms. In Java, polymorphism can be achieved through method overloading and method overriding. Method overloading means that multiple methods can have the same name but different parameters. Method overriding means that a subclass can provide a different implementation of a method that is already defined in its superclass. Polymorphism allows for more flexible and modular code design, as objects can be treated as their superclass type, allowing for easier code reuse and maintenance. 2. Applet vs Application: An applet is a small program that runs within a web browser. It is written in Java and can be embedded into a web page using HTML. Applets are designed to be run on any computer with a Java Virtual Machine (JVM) installed, making them platform-independent. In contrast, an application is a standalone program that runs on a computer's operat...