How to Implement a Stack using an Array

Показать описание

In this video, we are going to learn about implementing a stack using array
We’re going to implement the following functions:
Push(pushes element in a stack)
Pop(removes the top element from stack)
Top(return the top element present in a stack)
Size(returns the size of stack)
Isempty(returns a bool value; to tell if a stack is empty or not)

In this video, you’ll also learn about asymptotic notations, they are basically mathematical notations which represent order of growth of any mathematical function. There are three famous notations which you’ll see in this video, they are big O , Theta , Omega.

Welcome to the first video Tutorial on Data Structures And Algorithms. In this video I am going to provide an Introduction to Data Structures And Algorithms. This Course is created to Explain the Fundamentals of data structures and algorithms. This video Will explain What is data?, What is data structure?, The Need for Data Structures, What is algorithm?

#DataStructures #Algorithms #DSandAlgo #ProgrammingKnowledge

★★★Top Online Courses From ProgrammingKnowledge ★★★

★★★ Online Courses to learn ★★★

★★★ Follow ★★★

DISCLAIMER: This video and description contains affiliate links, which means that if you click on one of the product links, I’ll receive a small commission. This help support the channel and allows us to continue to make videos like this. Thank you for the support!