Notes have been uploaded - codewithharry.com/videos/data-structures-and-algorithms-in-hindi-9 Please share this video guys! It will make it easy for me to provide better and better free quality content! Here is my Instagram - instagram.com/CodeWithHarry
@@CodeWithHarry sir plese suru se v coaching sikhaye na aap ka bahut jaldi subscribe badhega app jaise koi nahi samjhata hai sir so pls aap suru se coading sikhaye plz sir 😩😩😩😩 🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮
@@CodeWithHarry sir aap boldijiye hm wait kare aap ka video ka ya koi umid na rakhe ya unsubscribe kr de boliye aap hi sir i hope you understand Plz sir my help sir aap se koi pahle v kaha hai ki aap suru se coading sikhaye boliye Plz reply me
17:50 Best Case O(1) : When element is to be deleted from last index of the array. Worst Case O(size of the array) : When we have to delete the 1st (0th) index element from the array.
17:40 Best case -> The best case will be if we get the last index to delete. In that case, we would not have to shift anything the time taken will be a kn^0, where k is the time required to delete the item at the last index eliminating the constant we get O(1). Worst case -> The worst case will be if we get the item at the zeroth element to delete. In that case, we would have to shift the entire members of array hence the formula will be kn, where k is the time required to delete the item at the first index, eliminating the constant we get O(n).
• Best Case deletion:- (Deleting the last element of the array) Time Complexity: O(1) • Worst Case deletion:-( Deleting the 0th index element or any element between other elements) Time Complexity: O(n) (Where n is the number of elements in the array)
17:44 Best case ..O(1) : when an element is deleted from the last index in array. Worst Case ...O(n): when an element is deleted from the first index in an array.
I don't know how many of viewers understands ur efforts....but I am damn sure that it takes lots of effort much more than u think for quality content and notes for each & every video..... Thank you....I wish and I predict u reach great heights
For Deletion: Best case--> O(1) [ Deleting the last element] * If order matters worst case--> O(n) [ Deleting the first element, so we have to decrease -1 index for every element of array.]
For deletion array:- Best case 0(1) when an element has to delete from last index in array Worst case 0(n) When an element has to delete from first index in array
Best case will be to delete the last element of array with time complexity 0(1) & The worst case to delete the 1st element coz we have to move all the element in this case it will take time complexity of 0(n)
Summary of the video- Traversal(){ //When to use traversal } Insertion, deletion(){ Case 1:order should be maintained case 2:order doesn't matter.} Searching(){ //Used size should be updated. Linear search:algo 1(previous videos) binary search:algo 2(previous videos) }
17:55 best case : O(1) if the element we have to delete is the last element of the array worst case : O(n) if element is at the begging and n elements are there
bhaiya aapke bas 521 views kuu hai iss video pr to 1m + hone chahiye the 😔😔 i really appreciate how much hardwork u do to bring video every day keep working hard u will surely get the results 💪💪
17:43 Best case is O(1) --> When The last element of an array is to be deleted And Worst Case is O(n) --> When the element of first place is to be deleted and for that we have to shift all the element in (n-1)Direction !
So the worst case in the deletion operation is that when we have to delete an element from 0th index, the complexity of this case is O(n) and the best case is when we have to delete an element from the last index as we don't have to shift any element so the time complexity here is O(1).
17:42 Best case :- array ke last element ka deletion karna hoga to kisi bhi element ko shift karne ki jarurat nahi padegi (complexity :- O(1)) Worst case :- array ke fist element ko delete karna hai to sabhi elements ko shift karna padega so complexity is O(n).
For a element to delete in array, best case is : O(1) that is deleting last element in array no need to shift elements to left side. Worst case:O(n) that is deleting 1 st element i.e at 0 index in the array and we have to shift remaining n elements to left side in array.
Best case deletion:O(1) and worst case:O(n) and same for insertion also. If the insertion or deletion is at the end of the array then it will be the best condition(lucky as per harry bhaiya) and worst will be deleting or inserting from the beginning and shifting all the elements(unlucky as per harry bhaiya)
17:53 best case - O(1) kyuki agar last index ka nikaal diya toh Worst case - O(n) agar first index ka nikaal diya toh. Har element ko left shift karna hoga.
17:45 best case will be when we have to delete the element from last index where an element is present & time complexity would be O(1) and worst case would be when we have to delete from index 0 at starting & time complexity would be O(n) !
17:51 Deletion best case: O(1) when we're supposed to delete the nth or last element. Worst Case: O(n), When we're supposed to delete the first element.
For deletion the best case time complexity is O(1) and for worst case it is O(n). As it would take n number of times to swap if the number has to be deleted lets say from the 3rd index respectively. While for the 2nd case, to my knowledge it will remain same for both worst and best case which is O(1).
17:32 Time Complexity of Deletion is :- 1) Best case = We have to remove last element ----> O(1) 2) Worst case = We have to remove First Element -----> O(n) Where, n is the Size of the array
17:50 The best Case - To delete last element of the array. In this case O(1) The worst Case - To delete First element of the array(element at 0th index). In this case O(n)
Harry Bhai aap jo comedy ka use karte ho video ke beech beech main wo boht acchi hoti h iss karan agar aapki video boht jyada long bhi hoti h to accha lagta h. esa feel nahi hota ki yaar video kab kahatam hogi yahi baat aapko dusro se alag bnati h always be happy in your life😁😁😁😁😁 main sochta tha ki IIT main jo bachhe padte h unko kesa padate honge but app ne wo bhi bta diya inn video ke through thank you for your free course.
Best case deletion is : delete last element of array and it's complexity is O(1) worst case deletion: delete element from first position of array and shift remaining element to full empty space
17:43 The best case complexity is O(1) in that case we have to delete the element at the last position in that we have not to shift the elements by its position. Similarly the worst case complexity is O(n) in that case we have to delate the element at the zero index and we have to shift the n elements so complexity is O(n)
Notes have been uploaded - codewithharry.com/videos/data-structures-and-algorithms-in-hindi-9
Please share this video guys! It will make it easy for me to provide better and better free quality content!
Here is my Instagram - instagram.com/CodeWithHarry
Sir aaap nai Jarvis wala video banay but sir code pura theek likha
Par computer bol nahii pata
Actually sound nahii Aaarahi
Plzxzz help
Sir suru se coading sikhaye na PLZZ sir
PLZZ sir suru se coading sikhaye na PLZZ sir
Sir aap suru se coading sikhaye na plz sir aap ka subscribe bahut Jada badhega
Sir aap suru se coading sikhaye na plz sir aap ka subscribe bahut Jada badhega
deletion in array: Best Case: O(1), Worst Case: O(n)
Correct! Good job! Thanks for taking part :)
@@CodeWithHarry sir plese suru se v coaching sikhaye na aap ka bahut jaldi subscribe badhega app jaise koi nahi samjhata hai sir so pls aap suru se coading sikhaye plz sir 😩😩😩😩
🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮🇨🇮
@@CodeWithHarry sir aap boldijiye hm wait kare aap ka video ka ya koi umid na rakhe ya unsubscribe kr de boliye aap hi sir i hope you understand
Plz sir my help sir aap se koi pahle v kaha hai ki aap suru se coading sikhaye boliye
Plz reply me
@@CodeWithHarry sir agr is channel pr video nahi bana sakte to ek naya channel banaye suru se coading sikhaye plz sir
@@CodeWithHarry sir mai bahut hi jaldi aap jaisa ban sakta hu ek bar mauka to de kar dekhiye
Bro the amount of efforts you put in YT is just unmatched by any other!! Total support brother ♥️💯
How i get notes
Right bro i almost seen every one maximum creater make u pay for learning
17:50 Best Case O(1) : When element is to be deleted from last index of the array.
Worst Case O(size of the array) : When we have to delete the 1st (0th) index element from the array.
17:40
Best case -> The best case will be if we get the last index to delete. In that case, we would not have to shift anything the time taken will be a kn^0, where k is the time required to delete the item at the last index eliminating the constant we get O(1).
Worst case -> The worst case will be if we get the item at the zeroth element to delete. In that case, we would have to shift the entire members of array hence the formula will be kn, where k is the time required to delete the item at the first index, eliminating the constant we get O(n).
Bhai kya explainnation ki h love u bro 😊😊😊👍👍👍
• Best Case deletion:- (Deleting the last element of the array)
Time Complexity: O(1)
• Worst Case deletion:-( Deleting the 0th index element or any element between other elements)
Time Complexity: O(n)
(Where n is the number of elements in the array)
Thanks 😌
Yes...
You are best teacher in the world 🤘🏻👍
17:44
Best case ..O(1) : when an element is deleted from the last index in array.
Worst Case ...O(n): when an element is deleted from the first index in an array.
👍
worst case : O(n-1) hona chahiye na bro
I don't know how many of viewers understands ur efforts....but I am damn sure that it takes lots of effort much more than u think for quality content and notes for each & every video.....
Thank you....I wish and I predict u reach great heights
17:59, Best case: 0(1) when we just delete, 0(n) when we delete and move all elements back one block. Nice video!
worst case : O(n-1) hona chahiye na bro
Bro keep going, I expect everything to be explained in very detail so that I don't need to do any course from anywhere.
For Deletion:
Best case--> O(1) [ Deleting the last element]
* If order matters worst case--> O(n) [ Deleting the first element, so we have to decrease -1 index for every element of array.]
Me in my online classes:"vae kuch samjh ni aaa raha "
Then suddenly your notifications of array operations came😂😂..... Thanks bruh✌✌
Hiii
17:42
For deletion in arrays
0(1) :- when we want to delete the last element of array.
0(n) :- when we want to delete the first element of array.
Bhai ki mehnat ke liye ek like aur ek comment per person to banta hi h 👍. Thank u Harry bhai
serving the humainity is very good quality of someone.
Harry bhai thank you so much for making environment to seek programming efficiently,easily.
17:55
if the element that has to be deleted is at the the lastmost position, then the complexity would be O(1)
otherwise it would be O(n)
You are the person who is saving life of every engineer.... I'm from civil thankyou harry
from which college
@@chiragcs22IIT Kanpur
For deletion array:- Best case 0(1) when an element has to delete from last index in array
Worst case 0(n)
When an element has to delete from first index in array
aman bhaiya and harry bhai will change the education system ...they are revolutionary person .....full supoort
Best case will be to delete the last element of array with time complexity 0(1)
&
The worst case to delete the 1st element coz we have to move all the element in this case it will take time complexity of 0(n)
I love how he plans out his lectures. There's not many teachers who won't stutter while looking at a camera in an empty room.
Nice Harry ! Plz try to make videos related to complex algo/programming like "Assembly Line Scheduling" , "0-1 Knapsack Problem" etc.
17:26
Best Case - O(1) (Deletion at end)
Worst Case Scenario - O(n) (Deleting First Element at 0th index)
Summary of the video-
Traversal(){
//When to use traversal
}
Insertion, deletion(){
Case 1:order should be maintained
case 2:order doesn't matter.}
Searching(){
//Used size should be updated.
Linear search:algo 1(previous videos)
binary search:algo 2(previous videos)
}
Hii
17:55 best case : O(1) if the element we have to delete is the last element of the array worst case : O(n) if element is at the begging and n elements are there
Harry Bhai be like : Traversal nehi batayunga , woh sab to 2+2 jaise hain
Also Harry Bhai : writes the whole traversal process while telling so.. 😂😂
Ur nai batauga bolke puri Ramayana bta dete mahan hai Apne Harry bhai 😂😂🤣🤣
2*2= 4 ka example tha
@@poorvashinde8059 iska kya mtlb?
@@aryangangotia9240 harry Bhai ne multiplication ka example Diya tha addition ka nahi
17:43 deletion time complexity best case O(1) worst case O (n)
bhaiya aapke bas 521 views kuu hai
iss video pr to 1m + hone chahiye the
😔😔
i really appreciate how much hardwork u do to bring video every day
keep working hard u will surely get the results
💪💪
New vid hai bro 😀
17:52 --> Best case O(1) and the Worst case is going to be --> O(n)
😂😂mko apni ungli gandi krne pdege 😂never gets bored with his way of teaching adding small relatable stories 🌼🌼
Harry Potter of coding 😗
You are really a best teacher in this whole world.... Sorry in this whole universe ☺
sir i want a vedio on how to get employed in google with python or any programming language as i am not having any degree
i am requesting from past 2 monts plz kal baana do yaar
Good bro
@@tessreactgamer6454 thank u for your support yaar
plz give likes for support me
@@shauryakumar7544 mention not brother 🙂🙂
17:54
deletion ka best case O(1)
and worst case O(n)
*Kaun kaun Java Course chahate ho? Harry Please👨💻👨💻*
👇 We want
👇 Java
Java Course launch kro
Yes
@@ViralXtreme yes
17:53 best case: deletion at end
Avg case : deletion at middle index.
Worst case: deletion at first index
1:50 yeh sab nai bataunga
but fir bi bata diya so that kisi ke mann me reh na jaye xd
17:43
Best case is O(1) --> When The last element of an array is to be deleted
And
Worst Case is O(n) --> When the element of first place is to be deleted and for that we have to shift all the element in (n-1)Direction !
24:07 He's so funnyyyyy 🤣
So the worst case in the deletion operation is that when we have to delete an element from 0th index, the complexity of this case is O(n) and the best case is when we have to delete an element from the last index as we don't have to shift any element so the time complexity here is O(1).
Zip file ko unzip nahi karne ata aur dsa sikh rahe hai 😂😅
IIT silver medalist hai don't judge anyone
16:04 se 16:37 tk dekho sir kya bole and phir bolo aata hai ki na
He is iit Kharagpur passout don't judge it
Just to clarify I am talking about students who doesn't even know how to unzip I know he is very talented that's why I am learning from him....
Kaise karte he zip ko unzip@@coolsai
17:50
Best case is O(1)
Worst case O(n)(1st element delete)
17:35
Best case of deletion :-O(1)
Worst case of deletion :- O(n)
Thank you Harry sir for help & पूरा प्रबन्ध ❤️
17:42
Best case :- array ke last element ka deletion karna hoga to kisi bhi element ko shift karne ki jarurat nahi padegi (complexity :- O(1))
Worst case :- array ke fist element ko delete karna hai to sabhi elements ko shift karna padega so complexity is O(n).
One of the best channel for coding.
17:56
Best case : O(1)
Worst case :O(n)
For a element to delete in array, best case is : O(1) that is deleting last element in array no need to shift elements to left side.
Worst case:O(n) that is deleting 1 st element i.e at 0 index in the array and we have to shift remaining n elements to left side in array.
18:03 .. Best Case O(1) and Worst Case O(n).... Thank you Harry Bhai 🫡 !!
Congratulation for your 500k subscriber in advance.
17:49 Deletion
Best Case O(1)
Worst Case O(n)
Thanks brother if you don't exist this world idk how would i learn coding ❤
Best case deletion:O(1) and worst case:O(n) and same for insertion also. If the insertion or deletion is at the end of the array then it will be the best condition(lucky as per harry bhaiya) and worst will be deleting or inserting from the beginning and shifting all the elements(unlucky as per harry bhaiya)
17:51 base case O(1)
worst case O(N)
Follow this kind of person support them..!
Harry Bro I am totally supporting you what a video delivering style with awesome explanations You are Awesome Keep it up dear friend
Thanks alot for your time and energy to explain these concept in such a easy way may God bless you
17:52
Worst Case -> O(n)[delete first element]
Best Case -> O(1) [delete last element]
17:45
Best Case Complexity : O(1)
Worst Case Complexity: O(n)
17:53 best case - O(1) kyuki agar last index ka nikaal diya toh
Worst case - O(n) agar first index ka nikaal diya toh. Har element ko left shift karna hoga.
17:42 Best case-> O(1) Worst Case->O(n)
17: 47 : Deletion - Best Case: O(1), Worst Case: O(n)
17:45 best case will be when we have to delete the element from last index where an element is present & time complexity would be O(1) and worst case would be when we have to delete from index 0 at starting & time complexity would be O(n) !
17:25 best case O(1) worst case O(n)
17:40
For Deletion
bast case: O(1)
worst case: O(n)
I really hope that harry should get millions and billions of subscribers 😌😌
18:04 best case deletion is when u have to delete element from end
And worst case deletion is when u have to delete element from first position
18:00
Deletion best case is last element deletion.big O(1)
Worst case is firlst element deletion.big O(n)
17:51 Deletion best case: O(1) when we're supposed to delete the nth or last element. Worst Case: O(n), When we're supposed to delete the first element.
17:41:00
best case O(1)--> IF we have to delete last element of array
worst case O(n)--> IF we have to delete first element of array
Time stamp 17.51
Best case O(1)
Worst case O(n)
Deletion in array .
Best case complexity = O(1)
Worst case complexity= O(n)
17:51 worst case O(n) and best case O(1)
deletion case => best case=O(1) and worst case =O(n)
For deletion the best case time complexity is O(1) and for worst case it is O(n). As it would take n number of times to swap if the number has to be deleted lets say from the 3rd index respectively.
While for the 2nd case, to my knowledge it will remain same for both worst and best case which is O(1).
17:40 Best case: Deletion at last element with Time Complexity of O(1)
Worst Case: Deletion at index 0 with Time Complexity of O(n)
17:32 Time Complexity of Deletion is :-
1) Best case = We have to remove last element ----> O(1)
2) Worst case = We have to remove First Element -----> O(n)
Where, n is the Size of the array
18:18 the best case of deletion
O(1)
and worst case O(n)
Best case of deleat is 0(1)
Worst case of deleat is 0(n)
And thankyou so much sir for your priceless efforts❤️
17:48 1) If element is in 0th index then on deletion complexity O(n) , 2) If element is in last Index then complexity O(1)
17:45
Best Case Time Complexity of deletion - O(1)
Worst Case Time Complexity of deletion - O(n) where n is the no. of elements in the array
You are one of the most helpful youtuber 🍀
17:50
best case time complexity: O(1),
worst case time complexity: O(n).
best case-o(1)
wrose case-0(n)
Deletion : best case O(1) , worst case O(n)
17:50
The best Case - To delete last element of the array. In this case O(1)
The worst Case - To delete First element of the array(element at 0th index). In this case O(n)
17:42
Best Case - O(1) - constant
Worst Case - O(n) - linearly
17:41
Deleation in array
Best Case: O(1)
Worst Case:- O(n)
Best case of deletion and Best case of insertion is the same.
and thank you sir for providing us with such free and best content
I always watch the full ads that comes in your videos....Just because of your hardwork....🔥
congrats for 500k subscribers Harry sir
17:42 For deletion Best case O(1) when we delete the last element and for Worst case O(n), because it depends on number of steps.
Harry Bhai aap jo comedy ka use karte ho video ke beech beech main wo boht acchi hoti h iss karan agar aapki video boht jyada long bhi hoti h to accha lagta h. esa feel nahi hota ki yaar video kab kahatam hogi yahi baat aapko dusro se alag bnati h
always be happy in your life😁😁😁😁😁
main sochta tha ki IIT main jo bachhe padte h unko kesa padate honge but app ne wo bhi bta diya inn video ke through
thank you for your free course.
17:43 best case: Delete the last element of the array
Question at 17:55
Best Case last element of an array O(1).
Worst Case first element of an array O(n).
Because of shifting all elements...
Thanks
18:01 Best case time complexity for deletion is O(1) and Worst case is O(n)
Best case deletion is : delete last element of array and it's complexity is O(1)
worst case deletion: delete element from first position of array and shift remaining element to full empty space
17:40 --> Deletion Best case : O(1) and Worst case : O(n)
17:58 best case O(1) deleting last element, worst case O(n) deleting 0th element and shift all.
17:43 The best case complexity is O(1) in that case we have to delete the element at the last position in that we have not to shift the elements by its position. Similarly the worst case complexity is O(n) in that case we have to delate the element at the zero index and we have to shift the n elements so complexity is O(n)