Time complexity and Comparison of All Data Structures

[@tarunverma3335]

This type of videos are really helpful specially near gate

[@rishabhchakraborty2628]

THE BEST TEACHER, WITH ZERO HATER!!

[@abhishekkumartiwari3834]

Seen your DBMS playlist ,my college exam of DBMS was a very nice paper to write because of you..🙏🙏 Thank you,Sir..

[@shreyasfunworld8484]

I am blessed to have a teacher like you 🙏❤

[@moonfahim]

you are the king of teachers in youtube! Thank you

[@surjendu009]

Thank you sir for your great teaching techniques😊 I liked your teaching techniques and it's easy to understand ❤

[@abhis3kh]

have an interview, great content with great timing. Thank you very much sir.

[@praveshikaupadhyay1233]

Your videos are really a game changer for my exams.

[@vijaysinghrathore8601]

can i clear my semester exam after watching this playlist please reply

[@surbhi_official9206]

I am very grateful for this video, thank you so much sir (subscriber from last 2 years :))

[@abcdrabcds2306]

Great sir very nice. sir ap extraordinary intelligent ha.

[@JD_dhc]

Are sir mza aa gya ...aj subah se search kr rha hu ...aur aaj hi upload kr dia aapne ... ❤️❤️❤️🙏🙏🙏 I will share your channel to all of my friends 🙏

[@GateSmashers]

Thank you

[@everyone2905]

Sir, Thanks a ton for this video.

[@sarthakchaudhary4375]

Insertion at the end of an unsorted array is O(1), insertion at worse case(that is at the start of the array) is O(n). Even average case is O(n). Same with deletion. Insertion is O(n) as you have to shift the elements to make room for inserted element Deletion is O(n) as you have to shift the elements to fill up room created by deleted element

[@samuelcampbell9938]

Thank you for pointing this out. I think its worth mentioning that there are ways to amortize the runtime down to O(1), though

[@islamicinfluen]

@@samuelcampbell9938 r0km Ememereeltek

[@reshavroushan9565]

Thank you so much sir

[@simrankaur2588]

Wahhh sir u r superb thank you so much

[@siddhant2002]

1:42 *sir agar hame delete karana hai to koi particular data ko hi karana hogana to wrost case O(n) hona chahiye.*

[@hmm7458]

actually he explained it later that deleting a particular element will be equivalent to first finding it which will take O(n) time and deleting it which will take O(1) time.. so yeah deleting still is done in constant time

[@maabakhtar4040]

sir ap itna acha samjhate hai pr hmre sub ke full topic nhi h kash hote

[@mousumikhatun3008]

Thank you so much sir.. Love you

[@chaitanyadeshmukh3149]

Thank you so much sir you are great!!!!

[@shivamkumar8744]

Waiting for more videos on algorithm and Data structures sir✨♥

[@manpreetkaur-k2k9k]

thanks sir 4 important content

[@anupammishra6514]

This is very very good video 👍👍👍

[@SoumyaCakeRecipes]

Thanks😅

[@sonalimondal2716]

I have seen all ur videos....its very helpful for me to....plz explain BFS and DFS

[@Grishma_Gedela]

WOW 💝💝

[@shreyachakrabarty6521]

Thankyou Sir 😊😊

[@KumarDinesh-zw2vq]

THANK U SO MUCH

[@moonfahim]

Thank You!

[@mohammadfaizan1199]

Sir plz data structures k topic ko continue rkkhna 👍 ek playlist bna dijiye

[@shivamkumar8744]

Sir, please complete this playlist ASAP.

[@ganbare242]

completed all 78 videos

[@pratikkurra4754]

Are heap, priority queues, graphs etc part of your paid courses? @gate Smashers. Please let us know. So we can switch to paid versions, because here syllabus is incomplete. Also, great covering of concepts

[@anusrutimitra1115]

Before gate best gift from sir❤️🙏

[@hmm7458]

when is gate exam?

[@jkjaved831]

Sir data structure me graph nahi kraaye?

[@codingseekho001]

Sorted Array ke case me insert karna hai toh binary search se search karke insert kar sakte hai sir. Toh O(logn) hoga na?

[@debjyotipalit78]

Usse dhundh to loge ki kidhar insert karna hai...phir insert karte time shift bhi karna hoga. Manlo WC 1st position pe hi insert karna padha..toh pura n shift.

[@avantisahu6645]

Heap, hashing and B tree ke vdos kon se playlist me hain?

[@navagharkiran5769]

best case worst case average case ka bhi bata do sir

[@raghav_somani]

If you want to delete a particular element in unsorted array and linked list it will be O(n)

[@mahnoorali7354]

Respect from Pakistan

[@deepikachauhan3879]

Thank you sir

[@GAU-C--RATNAKANTAHANSE]

Thank you sir.....

[@abhay.rajak18]

Subscribers bahut jaruri hai

[@monikasharma7146]

Sir plz make a video on complexity in depth

[@skhojayfarahaman5867]

Sir, NET ka syllabus pe graphics design hay. Please make some video about graphics design. Thank you very much sir❤️.

[@Starwork09]

sir ek video difference between structured and unstructured data ke upar bhi bana do

[@gauravksk2333]

I have a doubt on time complexity of delete operation in unsorted linked list...because in worst case..to delete a particular element, first we have to search that element then only we can delete..so it should be O(n). Please clarify

[@abkohli9060]

Same doubt for unsorted array Its wring I think either it should be both o(1) or O(n) both cases unsorted and sorted

[@SubbiFun]

Thanks sir

[@umashanker2010]

Waiting Sir for hashing chapter

[@monarch2002]

tommorow interview I am watching this now 😂

[@KaiSetsuu]

😂😂

[@sonysingh-vw6quggfd]

Sir mujhe bhi job ke liye prepared hona hai... please aap se request hai ki DBMS aur SQL notes provide karen 👏🏻

[@shaziahussain5782]

Hi If in unsorted array we want to delete a number .shouldn't the worst case will be O(n) ..as the value might be in mid or ending?

[@pratikkurra4754]

Consideration is that if the array is as such unsorted, simply delete the element, instead of traversing across the array.

[@pratikkurra4754]

However your point is valid, if user wants to delete element at index n-1, he will have to traverse through n indexes.

[@ranajyoti99]

Sir mere assignment mai ye question aya ha ^a€ tm S time complexity plz solution btayiye

[@manomano2216]

Aoa mja apki queue and linklist ki types ki vides nhi mil rahiii or mja ki wording asani sa samj ajati ha please ap mja in topics ka liya guide kar day

[@adityaanand835]

sir aap bhi unacademy jaoge kya? just asking

[@sulectures2773]

Tq Sir

[@hanishathakur3973]

Sir plzz make a video on web technology i have my final exam

[@varsharani7524]

Sir plz dssssb ke lea help kro kya itne deeply aata h

[@blackrock1404]

😊

[@nikhilbhosale4898]

Sir today 3 pm is my interview. Please give me some theory about prototype model and spiral model

[@satishmishra3713]

In which company

[@nikhilbhosale4898]

@@satishmishra3713 Wipro

[@satishmishra3713]

Bro plzz tell me how to prepare for it companies

[@nikhilbhosale4898]

@@satishmishra3713 dm me on Instagram at nikhil_bhosale_22

[@nikhilbhosale4898]

My interview is done and I was good

[@SanketSharmasanket7317]

🙏🎂🎈👍❤🇮🇳

[@shubhangihatkar1347]

⭐⭐⭐⭐⭐

[@PrakulDhiman-ng3pp]

love u