max() function for valarray in C++

valarray min() in C++

Last Updated : 23 Jun, 2020

The min() function is defined in valarray header file. This function returns the smallest value contained in the valarray. Syntax:

T min() const;

Returns: This function returns the minimum value in the valarray. Below programs illustrate the above function: Example 1:-

CPP

// C++ program to demonstrate
// example of min() function.

#include <bits/stdc++.h>
using namespace std;

int main()
{
    // Initializing valarray
    valarray<int> varr = { 3, 2, 1, 4, 5 };

    // Displaying minimum element of valarray
    cout << "The smallest element"
         << " of valarray is = "
         << varr.min() << endl;

    return 0;
}

Output:

The smallest element of valarray is = 1

Example 2:-

CPP

// C++ program to demonstrate
// example of min() function.

#include <bits/stdc++.h>
using namespace std;

int main()
{
    // Initializing valarray
    valarray<int> varr = { 22, 24, 36, 42, 12 };

    // Displaying minimum element of valarray
    cout << "The smallest element "
         << "of valarray is = "
         << varr.min() << endl;

    return 0;
}

Output:

The smallest element of valarray is = 12

max() function for valarray in C++

bansal_rtk_

Improve

Article Tags :

Practice Tags :

Similar Reads

max() function for valarray in C++

The max() function is defined in valarray header file. This function returns the largest value contained in the valarray. Syntax: T max() const; Parameter: This function doesn't accept any parameter. Returns: This function returns the maximum value in the valarray. Below programs illustrate the abov

Minimum MEX from all subarrays of length K

Given an array arr[] consisting of N distinct positive integers and an integer K, the task is to find the minimum MEX from all subarrays of length K. The MEX is the smallest positive integer that is not present in the array. Examples: Input: arr[] = {1, 2, 3}, K = 2Output: 1Explanation:All subarrays

sArray C/C++ ProgramsC Program to find sum of elements in a given arrayC program to find largest element in an arrayRecursive C program to linearly search an element in a given arrayC program to multiply two matricesC/C++ Program for Given an array A[] and a number x, check for pair in A[] with sum

C++ Program for Pigeonhole Sort

Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is the number of elements in the input array and â€˜Rangeâ€™ is the number of poss

C++ Program to Find closest number in array

Given an array of sorted integers. We need to find the closest value to the given number. Array may contain duplicate values and negative numbers. Examples: Input : arr[] = {1, 2, 4, 5, 6, 6, 8, 9} Target number = 11 Output : 9 9 is closest to 11 in given array Input :arr[] = {2, 5, 6, 7, 8, 8, 9};

How to Find Minimum Element in a Vector in C++?

Given a vector of n elements, the task is to find the minimum element using C++.ExamplesInput: v = {2, 4, 1, 5, 3}Output: 1Explanation: 1 is the smallest element in the vectorInput: v = {12, 34, 5, 7}Output: 5Explanation: 5 is the smallest element in the vector.Following are the 6 different methods

C++ Program to Find the subarray with least average

Given an array arr[] of size n and integer k such that k Examples :Â Input: arr[] = {3, 7, 90, 20, 10, 50, 40}, k = 3 Output: Subarray between indexes 3 and 5 The subarray {20, 10, 50} has the least average among all subarrays of size 3. Input: arr[] = {3, 7, 5, 20, -10, 0, 12}, k = 2 Output: Subarr

C++ Program to Find the Second Largest Element in an Array

In C++, an array is a data structure that is used to store multiple values of similar data types in a contiguous memory location. In this article, we will learn how to find the second largest element in an array in C++. Examples: Input: arr[] = {34, 5, 16, 14, 56, 7, 56} Output: 34 Explanation: The

Smallest Pair Sum in an array

Given an array of distinct integers arr[], the task is to find a pair which has the minimum sum and print the sum. Examples: Input: arr[] = {1, 2, 3} Output: 3 The pair (1, 2) will have the minimum sum pair i.e. 1 + 2 = 3 Input: arr[] = {3, 5, 6, 2} Output: 5 Approach: Find the minimum element from

Working with Array and Vectors using STL in C++

Using STL library it is very easy to perform certain basic operations on array like Sorting, searching, sum of elements, finding minimum and maximum element of the array. Sorting Sorting can be done with the help of sort() function. sort(starting_index, last_index) â€“ To sort the given array/vector.