REVERSING A STRING USING STACK

Introduction :

In computer science, data structure is a particular way of sorting and organizing data in the computer so that it can be used efficiently. The implementation of a data structure usually requires writing a set of procedures that create and manipulate instances of that structure. The efficiency of a data structure cannot be analyzed separately from those operations. A stack is an abstract data type and data structure based on the principle of Last In First Out(LIFO). There are two main operations: push and pop. The push operation adds (stores) to the list. Due to practical memory limits, stacks are often of a particular size, so this operation must check that the stack is not full, otherwise it will fail. The pop operation removes (deletes) an item from the list, AND returns or exports this item value to the calling program. The pop operation must check to see if the stack is not empty, otherwise it will fail.

Templates:

C++ templates enable generic programming. C++ supports both function and class templates. Templates may be parameterized by types, compile-time constants, and other templates. C++ templates are implemented by instantiation at compile-time. To instantiate a template, compilers substitute specific arguments for a template's parameters to generate a concrete function or class instance. Templates are a powerful tool that can be used for generic programming, template metaprogramming, and code optimization, but this power implies a cost. Template use may increase code size, since each template instantiation produces a copy of the template code: one for each set of template arguments. This is in contrast to run-time generics seen in other languages (e.g. Java) where at compile-time the type is erased and a single template body is preserved.