Added: 2 years ago
From: UNSWelearning
Views: 9,474
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (15)

Sign In or Sign Up now to post a comment!
  • excellent.

  • Brilliant!

  • I am starting to love programming because of him.

  • WOW forget silly television shows. this is now my favorite show to watch. I will know so much by the season finale !

    THANK YOU MAN!

  • Richard, thank you for putting these up. I am taking an ADT and Algorithm upper division course this fall, so these are great to freshen up and gain some new knowledge before I start class in September.

  • Richard, you are an excellent lecturer. Really appreciate you putting these videos up. I was looking for material on Sorting algorithms, and I watched some of the videos put up on MIT's youtube page. I must say, I love your approach to teaching. While others choose to copy algorithms off of a sheet of paper and write them on the board, you actually walk through the process of the algorithm with your students. I really admire that. It's a great way to learn. Thank you so much! :)

    Best Wishes.

  • Actually the best case of Bubblesort is O(n) not O(n²).

  • @videofemto That's bubblesort with early exit.

  • Please keep putting these up, a great professor!

  • Either that or the lecture room is full of a bunch of indifferent 18-20 year olds who are trying to sleep. Richard does a great job of keeping them awake compared to other lecturers.

  • The rewind effect was superb :)

  • I second that! Richard is such an awesome teacher.

  • Really appreciate you putting all these up :D

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