Added: 3 years ago
From: nptelhrd
Views: 63,935
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (48)

Sign In or Sign Up now to post a comment!
  • Comment removed

  • Comment removed

  • this  teacher knows how to use ppt to teach complex areas

  • is it right that you just take a random element as a pivot?

  • @exelto111 i think the easiest pivot would be the center of the subarray

  • @exelto111 yes, i usually just chose the first one

  • 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.

  • 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.

  • Small bug in partition routine: use x <- A[p] instead of A[r]

  • to me,Dr. Naveen Garg is the smartest teacher among all nptelhrd series.

  • 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 !

  • I'm not lucky i'm Naveen.

    LOL goodone

  • The greater-than and lower-than signs are wrong in this example. You have to switch them.

  • thank you very much for uploading this!!! this helped me alot!!

  • 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.

  • Great prof. nice one sir. how i wish, I have a prof. like you. simplicity leads to better understanding. ;)

    

  • would be better with subtitles

  • @OverflowC it would.. at least when he starts talking indian or something.. its hard to understand that way..

  • Very nice.

  • awesome... thank u sir

  • Only if all professors could be like him! 8sigh*

  • seriously amazing....

  • man, that guy is awesome... i wish i would have a professor like him!

  • awesome... thank u sir:-)

  • So you better think about staying off :-).

    BTW Ramadan Sucks :-)))

  • 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.

  • @ReandeBlog ,true !!

  • >@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 ReandeBlog is a moron, no engineer or computer science graduate would make such a stupid argument.

  • 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.

  • stop learning about computers.. we dont want all our jobs outsourced to india

  • uk isn't the only country which have computers

  • someone can't take a joke

  • but habib is very smart. lol

  • Brilliantly Explained!Thanks a lot Sir

  • very nice explained

  • Inder+English = AMAZING xD

  • <3  <3

  • aww... what a great channel... but the accent is a bit too hard to understand for me

  • YOU CAN SAY HEY!

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more