Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
mam your teaching is very amazing......
Thank you😊
mam make new video on linear and binary search, because old video doesn't have algorithm. Please mam!!
@@i.cyberboy 👍
24:02 Hw answer is time complexity for best case is O(1). And for worst case O(n-1) which is O(n).. Is my hw answer write mam?
Thanku mam ❤best explanation 🥰
@@Aditi-t9z 😊
Maam insertion in array pe ek separate vedio provide kro ...thoda deeply
23:00 Hw question... Answer will be average time complexity is O(n/2) which will become O(n) .. Is it write mam?
Best explanation
😊
Traversal array mai i = i + 1 chahiye tha mam , for incremented value
Nice one 😀😀😇
Answer of H/W = Average complexity is O(n)
🥰👍nice explanation
Very lecture
Keep watching
mam can you share the link of linear search and binary search and sorting operation of array
I am sharing playlist with you. You can scroll and find whatever you are looking for in data structure. Hope it helpsua-cam.com/play/PLz_PatIPLDkBLnPxDiBjauB1wdNHPyxty.html
@@computershastra okey thanks mam
😍😍😍
:)
Thanks man I am ur new subscriber
aapka koi bhi link kaam nhi kr raha hai...
Kon sa link
playlist: ua-cam.com/play/PLz_PatIPLDkBLnPxDiBjauB1wdNHPyxty.html&si=DtV1bDyl5Q6pPSqp
👍
Madam total data structures in c++ link provide madam
ua-cam.com/play/PLz_PatIPLDkBLnPxDiBjauB1wdNHPyxty.html
Mam deletion of array ka algorithm smjh nhi aaya...!!
mam your teaching is very amazing......
Thank you😊
mam make new video on linear and binary search, because old video doesn't have algorithm. Please mam!!
@@i.cyberboy 👍
24:02 Hw answer is time complexity for best case is O(1). And for worst case O(n-1) which is O(n).. Is my hw answer write mam?
Thanku mam ❤best explanation 🥰
@@Aditi-t9z 😊
Maam insertion in array pe ek separate vedio provide kro ...thoda deeply
23:00 Hw question... Answer will be average time complexity is O(n/2) which will become O(n) .. Is it write mam?
Best explanation
😊
Traversal array mai i = i + 1 chahiye tha mam , for incremented value
Nice one 😀😀😇
😊
Answer of H/W = Average complexity is O(n)
🥰👍nice explanation
😊
Very lecture
Keep watching
mam can you share the link of linear search and binary search and sorting operation of array
I am sharing playlist with you. You can scroll and find whatever you are looking for in data structure. Hope it helps
ua-cam.com/play/PLz_PatIPLDkBLnPxDiBjauB1wdNHPyxty.html
@@computershastra okey thanks mam
😊
😍😍😍
:)
Thanks man I am ur new subscriber
:)
aapka koi bhi link kaam nhi kr raha hai...
Kon sa link
playlist: ua-cam.com/play/PLz_PatIPLDkBLnPxDiBjauB1wdNHPyxty.html&si=DtV1bDyl5Q6pPSqp
👍
Madam total data structures in c++ link provide madam
ua-cam.com/play/PLz_PatIPLDkBLnPxDiBjauB1wdNHPyxty.html
Mam deletion of array ka algorithm smjh nhi aaya...!!