I am 2020 CSE passout, if there's one channel which I visited the most during my engg for short and precise explanation would be this one. Its like a I got a flashback of those days while watching this video.
Since 3 days preparing my exams , still preparing through watching ur videos very usefull and clarity, tqqqsooomuchhhhhh, and my classmates watching ur videos for xams
Mam your method of teaching problems are verry nice... It is very useful to me... And as a student i request yu to do the videos with algorithms explanations too
A problem will be called a NP HARD if every problem in NP can be reducible to 1 in polynomial time . A problem or set of decision problem will be called NP problem if it can be solved by non diterministic Turing machine in polynomial time
I am 2020 CSE passout, if there's one channel which I visited the most during my engg for short and precise explanation would be this one. Its like a I got a flashback of those days while watching this video.
Bhai koe tere ko qualification manga hai kya 🤧
@@suryakantamallick8559 maine tujhe personally dm karke bataya h kya ! 😂
bhai job lagi tujhe?
I dnt knw how thanx u i love ur teaching skills bcz u deliver a lecture in.a very short time nd understand good ❤️❤️🙏🏾🔥🔥
Since 3 days preparing my exams , still preparing through watching ur videos very usefull and clarity, tqqqsooomuchhhhhh, and my classmates watching ur videos for xams
Thank u soo much,you saves me a lot of time.....great explanation 👍
Thank you Mam ☺ i have clear my merge sort concept ... Thanks again
Your are such a intelligent person mam
The way you teach is really very adorable
Thanku...for the clear explanation... it's easy
Mam your method of teaching problems are verry nice... It is very useful to me... And as a student i request yu to do the videos with algorithms explanations too
very useful video on merge sort
wonderful explanation👍
stay bless
Thanks mam for explanation.This video is very helpful for MCA students.Again Thanks very much
Tqq so much akka 😍😍
Ur explanation is good and it's very clarity
Thank you so much mam... You are the best lecture in RUclips...
Thank you. I was lost as to what happens when the array size has an uneven amount of elements. Guess it wasn’t that big a deal.
It is so helpful for me..short but understable
Perfect explanation
Tnx a lot mam
The video time short 👌👌👌
tx you guys are life saver
Your teaching technique was very good 🙏🙏
Thank you mam .I understood this very easily
Tysm .....this is very simple techniques...
Very friendly method...
Love it...
In a very short time .....mam ur teaching is extraordinary 🥰
Thank u so much mam u made it simple 😊 to understand 🙂
Thanx mam it was very helpful for me 🙏🤗🤗 and I will done it from uh😊
Explain with algorithm and also types of merge sort
Thank you mam excellent explanation
Very good way to teach thanks
Ur teaching skills nd love short video ❤️
Thank you ma'am..you just gave me 4 marks
Really thank you so much for the wonderful explanation.👍
😎
I love you❤❤ your explanation is very good😉😌
mam your some videos are private or deleted pls upload them again, some concepts are missing and making examples difficult to understand
Thanks mam
Its a good explanation ❤
U made it easy for me
Before this lecture, go on Divide and Conquer lecture
Thank you for this video ❤️
Previous video of merge sort is showing private ...unable to watch that video
Thnk u mam it is very helpful to us
You helped me a lot ❤savior
Unbelievable explanation 👍
منورة يا حاجة ربي يعطيك الصحة والله
Tysm mam, most understanding mam
Tq madam super gaa cheparu madam tq Tq soo mach👌👌🥰
Thank you very helpful
Thank you ❤️
Thanks for the video mam
Small suggestion I feel logo of channel is upside down
Mam will u provide programs for sorting types , it is too nessesary
Thankyou so much :)
I love you mam , the way u explain
What is the function for dividing in two halves because elements are not equally divided
m = l + ( r- m )/2
Good Mam ... Thank You👍🏻
Mam your best teach
chachi kamaal ka video h
A lot of thanks to mam
Very helpful video ..
Thanks so very much dear
Ok ma'am, it's clear 👍
Thank you very much madam
how do i calculate the number of comparison ?
Thanks ma'am 🥰... love
Good explanation thanku mam
Thanks so much it's very helpful
Hiii
Super if I get tomorrow this question 😊
Thanks maam
Tnq soo much mam😍😘
Thank you very much
the previous video is private, some concept are missing please make it available
if two values are same so what we do
Last video is not available here
ThanQ so much
Tq very much sis
It's very interesting
Thank u mam u are the best teacher 💕
Thank you ma'am
Tomorrow is my exam and you help me Ty
How to devide array by n
God bless u
😂
Thanks!🙏
Thank you mam
doing this thing in book is so simple as compare to coding
Thank you
Nice sister 👍👌 tq
It's easy😊👍
thanks
Great madam
Awesome explanation 👏👏👏
Thanks
Love from odisha maam
Super mam🎉
Thank u
Thanks madam
Nice trick
Nyc trick
A problem will be called a NP HARD if every problem in NP can be reducible to 1 in polynomial time .
A problem or set of decision problem will be called NP problem if it can be solved by non diterministic Turing machine in polynomial time
thank u
Plz explain the merge algorithm
Is ka programs bhi h
way better videos than abdul bari sir... less confusing...
good example
Hi Maam great video. Where did you buy your pens?
vry nice