online advertising

Saturday, October 24, 2015

Algorithms: Design and Analysis, Part 1 - Programming Question 2

Problem:

Compute the number of comparison in QuickSort with different partitioning strategies

Solution: 

I don't really like this programming assignment, it is really just implement exactly as what the lecture slide said.

3 comments:

  1. Not able to correct answers with the code

    ReplyDelete
  2. This comment has been removed by the author.

    ReplyDelete
  3. Hi Andrew! Thanks for publishing your solutions. It helped me a lot!
    I basically rewrote your solution in Ruby. Thanks again!

    https://github.com/fwuensche/algorithms/blob/master/stanford-algorithms-part-1-week-2/quicksort.rb

    ReplyDelete