can any one solve this question its C++ plz

[areesha]

Implement a Stack class to store the integers (maximum 50) with its usual push and pop functionality. Provide the following constructors: default and parameterized (to insert first element only). In addition to push and pop functions, define a friend function of class Stack named “find_index” with two parameters: a Stack object and an integer value that the user wants to search in the stack. This function searches and returns the stack array index of the 2nd parameter, if match is found.

[S G H]

Homeworks? No, thanks.

[MrHutch]

In answer to your title; yes.

Come on, though, have a go. It won't hurt.

[Catfish2]

#include <cstddef>

class Stack {
private:
    std::size_t size;
    int ia[50];

public:
    Stack(): size(0)
    {}

    Stack(int n): size(1)
    {
        ia[0] = n;
    }

    int push()
    {
        // your turn!
    }

    int pop()
    {
        // your turn, again!
    }

    friend std::size_t find_index(Stack, int);
};

std::size_t find_index(Stack s, int i)
{
    std::size_t r=0;

    while (s.size != 0)
        if (s.pop() == i)
            return r;
        else
            ++r;

    throw "Couldn't find anything!";
}