C Code For Implementing Stack Using Array in Data Structures

preview_player
Показать описание
Stack array implementation C Code: In this video we will see how to implement stack using arrays using the c programming language

Best Hindi Videos For Learning Programming:

►C Language Complete Course In Hindi -

►JavaScript Complete Course In Hindi -

►Django Complete Course In Hindi -

Follow Me On Social Media
Рекомендации по теме
Комментарии
Автор

How is the course going so far. Any suggestions?
And what about the next course? Konsa start karna hai iske baad?

CodeWithHarry
Автор

if you are getting segmentation error or your code is not running... after initializing the name of the stack(struct stack * s) allocate a dynamic memory to the "s" like s = (struct stack *)malloc(sizeof(struct stack));

jaadui_chirag
Автор

This DSA playlist is an absolute lifesaver, you're a hero for us man.

EzioAuditore-vroy
Автор

struct stack *s;
s = (struct stack*)malloc(sizeof(struct stack));
s->size = 6;
s->top = -1;
This order works fine for me, as we need to provide first "how much memory the pointer would have" before accessing it.

mrrakeshmohansinghnegi
Автор

Yes sir Both Function isEmpty() and isFull() are working properly👍

omkarbhoir
Автор

13:29 isempty() and isfull() working and U are doing a great job for begginers like us...

pulkitsharma
Автор

💯 best coding teacher on YouTube 🔥🔥.keep going bhaiya

atuldwivedi
Автор

bcaz of you i am able to make all linked list code by myself

shreyanshdangi
Автор

struct stack *s = (struct stack *) malloc(sizeof(struct stack));

Write this, if you're not getting output.

MINGO
Автор

4:40 it will be better using struct Stack *s as call by reference will be much more convenient

sohanchakraborty
Автор

struct stack *s = (struct stack *)malloc(sizeof(struct stack));
s->size = 80;
s->top = -1;

s->arr = (int *)malloc(s->size * sizeof(int));

ab segmentation fault nhi aayega

raw
Автор

Yes Both Functions are working correctly

rajputchiragsingh
Автор

For C++ use this:
struct stack *s= new stack;
s->size =90;
s->top =-1;
s->arr =new int[s->size];

Mo
Автор

your given homework is completed both functions working fine

_cse_shivammishra
Автор

I like all your video . Please make videos on coding on android phone. Laptop is available for few time so make videos on coding on android mobile. Lot of people don't have laptop and want to learn coding so make on all the course of coding in phone . Like java, C,
C++ and HTML in android.

dratnalika
Автор

4:38
@4:38
#4:38
Yes sir because instead of writing a lengthy line like *(s).size we can simply write s -> size, though both are correct 😄😄

worldofmusic
Автор

bahut hi badiya lecture banate ho bhai aap .
Jaadu hai jaadu aapki teaching me ❤️❤️❤️❤️❤️❤️
I am waiting for tree and graph but I know next topic will be queue 😭

GeekyShubhamSharma
Автор

4:10 Use call by reference i.e pointers. I belive that is better than using call by value and copying values.

MensAttitude
Автор

Your all vid very useful for me., I just tuned with your data structure lec and i got very useful info from your all vid., keep it upp, Asehi vid bnaye rkho..
harry broo your are the grt

dhanashreepol
Автор

13:53 both isfull and isempty understood and implemented..

rahulstudies