Recursively Find the Minimum Value in a vector - C++ STL

Description

Recursively Find the Minimum Value in a vector

Demo Code

#include <ctime>
#include <iostream>
#include <vector>

int recursiveMinimum(const std::vector<int>&, int, int);

static const int LIMIT = 10;

int main(int argc, const char* argv[]) {
    std::vector<int> n(LIMIT);

    srand(time(0));/*from w  ww.j  a  v  a 2s  .  com*/

    for (int i = 0; i < LIMIT; ++i) {
        n[i] = rand() % LIMIT + 1;

        std::cout << n[i] << std::endl;
    }

    std::cout << "\nMinimum : " << recursiveMinimum(n, 0, LIMIT - 1) << std::endl;

    return 0;
}
// Returns the minimum value from an array recursively
int recursiveMinimum(const std::vector<int>& n, int start, int end) {
    static int minimum = n[start];

    std::cout << minimum << std::endl;

    if (start == end)
        return minimum;

    if (minimum < n[start + 1]) {
        return recursiveMinimum(n, ++start, end);
    }
    minimum = n[start + 1];
    return recursiveMinimum(n, ++start, end);
}

Result

• Previous
• Next

Related Tutorials

• Copying a vector, copy the contents of one vector into another.
• Using vectors Instead of Arrays to store built-in types, objects, pointers, etc. in a sequence
• Demonstrating C++ Standard Library class template vector.
• Use vector to track Dice Rolling random number
• Use a vector of integers to track value range