Good explanation - I have one doubt "you said we don't have structure change option in array - then add & delete operation will not be possible in arrays" right? then for that we need to use arraylist
@CSInTamil In the worst-case Array store big O= O(n), when its exceeds memory. Need to create a new array double the size of previous copy all the array values. and access to the index or location is O(1), which is the advantage of the array.
Bro in Big O notation n refers to number of operations or number of input size? And one more doubt neenga delete Operation ku O(n) soneenga. For example if in array there are 3 elements and if we delete a element at 0th index it will take O(n-1) dhaana? O(n) epdi ? Because element at 1st index will be shifted to 0th index and element at 2nd index will be shifted to 1st index.So 2 operation dhaana when there are 3 elements
n refers to the input size. Namma Big O notation la constant values represent panna maatom. Only as a function of the input size 'n'. So O(n), O(n - 1), O(n + 5) idhu elaame linear time. So idhu elaame namme O(n) apdinu solalaam. Similarly, O(n^2), O(n^2 + 5), O(n^2 + n) idhula elaame highest power is 2. So idhulaam namma O(n^2) nu represent panlaam because matha term, big values la romba contribute pannadhu.
From 12:10 I used "Square Bracket" which is wrong. I meant to say "Curly Brackets". Sorry about that
It's okay bro
Ungala maari aalunga irukka naaladhaan naatula mazha peyyudhu. Tysm bro.
Expecting also algorithms tutorials and advanced ds contents you were good at explaining keep it up bro
Thank u so much ,😊 lesson is super clear 💗
First 14 mins are about basic arrays,If you knew that,start from 14:16 .thank me later☺️
Which means basic of array, 😅 I don't know
Good explanation - I have one doubt "you said we don't have structure change option in array - then add & delete operation will not be possible in arrays" right? then for that we need to use arraylist
Super explanation
Excellent work bro 👏👏
@CSInTamil
In the worst-case Array store big O= O(n), when its exceeds memory. Need to create a new array double the size of previous
copy all the array values.
and access to the index or location is O(1), which is the advantage of the array.
vera level bro
please put advance java to make web development
Nandri bro..
Good explanation
Can u plss demonstrate data structures using python language
super channel 🎉
bro array la search la index based la search nadakuthu la ...so o(1) thana varum
very clearfull explain thanks
Excellent bro.
Keep rocking!!
Tq sir ❤️
Bro in Big O notation n refers to number of operations or number of input size?
And one more doubt neenga delete Operation ku O(n) soneenga.
For example if in array there are 3 elements and if we delete a element at 0th index it will take O(n-1) dhaana? O(n) epdi ? Because element at 1st index will be shifted to 0th index and element at 2nd index will be shifted to 1st index.So 2 operation dhaana when there are 3 elements
n refers to the input size.
Namma Big O notation la constant values represent panna maatom. Only as a function of the input size 'n'. So O(n), O(n - 1), O(n + 5) idhu elaame linear time. So idhu elaame namme O(n) apdinu solalaam. Similarly, O(n^2), O(n^2 + 5), O(n^2 + n) idhula elaame highest power is 2. So idhulaam namma O(n^2) nu represent panlaam because matha term, big values la romba contribute pannadhu.
@@CSinTamil Thanks Anna now it's clear
@@gnanavelpandian7756 then what is number of operations?
N refers to input size, O(N) refers to number of operations
Antha operation aa vachu ethachum example pannunga bro purila
pls post some contents about salesforce!!!
Hi bro, did have one mistake bro. Actully what was you said a[2] = 8,take the second index but a[2] = 5 only took that pls again saw that
Algorithm enga bro???
nice
can we do DSA in Javascript bro?
👏👏👏...
bro rows and column thappa solringa nu nenaikura rows ah column nu solringa column ah row nu solringa
🎉🎉🎉
Understanding is not complete. Not enough.
Thank you so much bro❤️