Princeton Algorithms: Part 1 [week 3: Quicksort]

Exercises

Explanation:

The correct answer is: 26 15 32 39 41 64 91 67 53 90 78 49

Here is the array before and after each exchange:

  i   j    0   1   2   3   4   5   6   7   8   9  10  11 
--------------------------------------------------------
  0  12   41  49  90  91  26  64  39  67  53  32  78  15  
  1  11   41  49  90  91  26  64  39  67  53  32  78  15  
  1  11   41  15  90  91  26  64  39  67  53  32  78  49  
  2   9   41  15  90  91  26  64  39  67  53  32  78  49  
  2   9   41  15  32  91  26  64  39  67  53  90  78  49  
  3   6   41  15  32  91  26  64  39  67  53  90  78  49  
  3   6   41  15  32  39  26  64  91  67  53  90  78  49  
  5   4   26  15  32  39  41  64  91  67  53  90  78  49  
      4   26  15  32  39  41  64  91  67  53  90  78  49  

Explanation:

The correct answer is: 24 55 26 54 57 57 57 57 83 61

Here is the array after each iteration:

 lt   i  gt    0   1   2   3   4   5   6   7   8   9 
----------------------------------------------------
  0   0   9   57  24  61  55  26  57  57  54  83  57  
  0   1   9   57  24  61  55  26  57  57  54  83  57  
  1   2   9   24  57  61  55  26  57  57  54  83  57  
  1   2   8   24  57  57  55  26  57  57  54  83  61  
  1   3   8   24  57  57  55  26  57  57  54  83  61  
  2   4   8   24  55  57  57  26  57  57  54  83  61  
  3   5   8   24  55  26  57  57  57  57  54  83  61  
  3   6   8   24  55  26  57  57  57  57  54  83  61  
  3   7   8   24  55  26  57  57  57  57  54  83  61  
  4   8   8   24  55  26  54  57  57  57  57  83  61  
  4   8   7   24  55  26  54  57  57  57  57  83  61  
  4       7   24  55  26  54  57  57  57  57  83  61  

Job Interview Questions

paper: http://www.cs.ucla.edu/~rafail/PUBLIC/17.pdf