I understand what ReandeBlog is saying. Professors do complicate things unnecessarily, but the topic of sorting is not that simple. People have put in years and years of research to come up with two chapters worth of text in a DS and Algorithms book.
That can be condensed and given to us in two chapters only because someone else has done all the hard work for us.
Also 10 year olds don't do quick sort! They probably do selection sort lol. I think this professor has done a superb job.
There is a bug in Partition routine. Consider what happens when i == j?
You cannot return j, you need to return j-1. Example.. if we sort an array that looks like this --> 1,2,3,4,20, j will point to 20 and i will eventually point to 20. In your routine you return j. This will cause an infinite loop. So if i == j, we need to return j-1, else return j.
The problem with universities (all universities no matter the country) is that they complicate a very simple algorithm. An algorithm that can be explained to a 10yr old in a matter of minute with the 10yr old understanding it - yet universities tend to complicate the learning process by including very big words, and breaking down the algorithm into smaller modules that they think actually help us.
even though I agree, it goes along the advertisement theory. you see the same ad over and over again enough, then it's gonna stick in your head. you add a little toon to it, and now when you hear that tune you think about the advertisement. the univerisity methods of teaching, include methods to not only keep the memory in your head, but to trigger the memory when you need it, without much pratice. which is actually what practice does to you.
Any 10 year old can sort - but to ask a computer to sort is another different story - your comment is very ignorant. Computer science is the toughest major in any University/College. High school students that have taken AP physics or AP Calculus or both still drop out of computer science because they do not understand recursion/sorting. Computer science needs to break it down to smaller modules to make it easier to program and code.
@ReandeBlog It's not just about the sorting algorithm itself. Of course anything is easy once somebody has figured it out how to do it. How do you make an egg spin well, you boil it first and spin it. The actual boiling of the egg is not hard. It's what kind of thought process the great minds took to discover the algorithm. Those big words and small modules you talked about are the precisely the tools those people used to come up with the algorithm and "proved" it's better than what's out there.
@jiminssy I guess it depends on whether you want to be a scientist that wants to discover new things or just a practician that implements existing algorithms. Computer science major is designed with science in mind.
Comment removed
jardelifce 1 month ago
Comment removed
jardelifce 1 month ago
this teacher knows how to use ppt to teach complex areas
nkhullar1 5 months ago in playlist Computer Sc - Data Structures and Algorithms
This has been flagged as spam show
Collection of Most frequently asked interview question: anandtechblog.blogspot.com/
algoforyou 9 months ago
is it right that you just take a random element as a pivot?
exelto111 10 months ago
@exelto111 i think the easiest pivot would be the center of the subarray
riotofdablood 10 months ago
@exelto111 yes, i usually just chose the first one
BuckMarley 2 months ago
I understand what ReandeBlog is saying. Professors do complicate things unnecessarily, but the topic of sorting is not that simple. People have put in years and years of research to come up with two chapters worth of text in a DS and Algorithms book.
That can be condensed and given to us in two chapters only because someone else has done all the hard work for us.
Also 10 year olds don't do quick sort! They probably do selection sort lol. I think this professor has done a superb job.
angelchild829 11 months ago
must be students, because in real life, you need to get your shit done asap, like by tomorrow. no time to sit around and jerk off over algorithms.
siliconsurf 11 months ago
Small bug in partition routine: use x <- A[p] instead of A[r]
venganesh 1 year ago
to me,Dr. Naveen Garg is the smartest teacher among all nptelhrd series.
zaheenbd1205 1 year ago
I'm from Sri Lanka.I study at a Sri Lankan university.
3 Lecturers so far tought Quick Sort so far.
but very few understood.Dr.Naveen explained it extremely well, if a person cannot understand his teaching, then it's not his fault !
joetube1988 1 year ago
I'm not lucky i'm Naveen.
LOL goodone
joetube1988 1 year ago
The greater-than and lower-than signs are wrong in this example. You have to switch them.
32ghzt54 1 year ago
thank you very much for uploading this!!! this helped me alot!!
pubz1988 1 year ago
There is a bug in Partition routine. Consider what happens when i == j?
You cannot return j, you need to return j-1. Example.. if we sort an array that looks like this --> 1,2,3,4,20, j will point to 20 and i will eventually point to 20. In your routine you return j. This will cause an infinite loop. So if i == j, we need to return j-1, else return j.
floridahunk1234 1 year ago
Great prof. nice one sir. how i wish, I have a prof. like you. simplicity leads to better understanding. ;)
vuraboz 1 year ago
would be better with subtitles
OverflowC 1 year ago
@OverflowC it would.. at least when he starts talking indian or something.. its hard to understand that way..
Ripadas 1 year ago
Very nice.
MurchhanaTripathy 2 years ago
awesome... thank u sir
anilhooda1 2 years ago
Only if all professors could be like him! 8sigh*
shubhamgandhi89 2 years ago
seriously amazing....
ssam1771 2 years ago
man, that guy is awesome... i wish i would have a professor like him!
PrinceofGaming 2 years ago 3
awesome... thank u sir:-)
premadk 2 years ago
This comment has received too many negative votes show
Sneaky Indians are truly to teach us the wrong things. They are going to take over the world. Ramadan rules
Asimo5000 2 years ago
So you better think about staying off :-).
BTW Ramadan Sucks :-)))
mohitsharmaonline 2 years ago
The problem with universities (all universities no matter the country) is that they complicate a very simple algorithm. An algorithm that can be explained to a 10yr old in a matter of minute with the 10yr old understanding it - yet universities tend to complicate the learning process by including very big words, and breaking down the algorithm into smaller modules that they think actually help us.
ReandeBlog 2 years ago 45
even though I agree, it goes along the advertisement theory. you see the same ad over and over again enough, then it's gonna stick in your head. you add a little toon to it, and now when you hear that tune you think about the advertisement. the univerisity methods of teaching, include methods to not only keep the memory in your head, but to trigger the memory when you need it, without much pratice. which is actually what practice does to you.
frosty1433 2 years ago
@ReandeBlog ,true !!
pbhushanbsb 1 year ago
>@ReandeBlog
I do not agree. I think this course is good and I am glad I found it.
This is a course in Data Structures and Algorithms
You must learn to use these terms Ordo, Theta, log(n).
You cannot explain to a 10 yrs old in normal
English how to prove that one algorithm is better over another under certain circumstances.
I think this is the meaning of Universities:
To learn new ideas and concepts its not to learn
an anecdote about quicksort that an 10 yrs. would grasp.
Buri8128 1 year ago
@Buri8128 ReandeBlog is a moron, no engineer or computer science graduate would make such a stupid argument.
UCSDEngineerDoctor 11 months ago 2
Any 10 year old can sort - but to ask a computer to sort is another different story - your comment is very ignorant. Computer science is the toughest major in any University/College. High school students that have taken AP physics or AP Calculus or both still drop out of computer science because they do not understand recursion/sorting. Computer science needs to break it down to smaller modules to make it easier to program and code.
UCSDEngineerDoctor 11 months ago
@ReandeBlog It's not just about the sorting algorithm itself. Of course anything is easy once somebody has figured it out how to do it. How do you make an egg spin well, you boil it first and spin it. The actual boiling of the egg is not hard. It's what kind of thought process the great minds took to discover the algorithm. Those big words and small modules you talked about are the precisely the tools those people used to come up with the algorithm and "proved" it's better than what's out there.
jiminssy 8 months ago
@jiminssy I guess it depends on whether you want to be a scientist that wants to discover new things or just a practician that implements existing algorithms. Computer science major is designed with science in mind.
jiminssy 8 months ago
stop learning about computers.. we dont want all our jobs outsourced to india
nukz0r 2 years ago
uk isn't the only country which have computers
alihammadshah 2 years ago
someone can't take a joke
nukz0r 2 years ago
but habib is very smart. lol
frosty1433 2 years ago
Brilliantly Explained!Thanks a lot Sir
nisha2308 3 years ago 4
very nice explained
costinnt89 3 years ago
Inder+English = AMAZING xD
Fallobst5 3 years ago
<3 <3
tuxbear 3 years ago
aww... what a great channel... but the accent is a bit too hard to understand for me
yifengsy 3 years ago
YOU CAN SAY HEY!
AudacityOfGrey 3 years ago