title: how many swap quicksort take to sort data in avg case?
body: <p>I am confuse between two answers of stakoverflow,</p>
  
  <p>my question is how many swap quicksort take to sort data in avg case ?</p>
  
  <p>Here is some link saying (1/3)nln(n) swaps on average</p>
  
  <p><a href="https://cs.stackexchange.com/questions/3/why-is-quicksort-better-than-other-sorting-algorithms-in-practice">link 1(in 1st answer -"Analyse abstract basic operations")</a></p>
  
  <p><a href="http://aofa2013.lsi.upc.edu/slides/Nebel.pdf" rel="nofollow noreferrer">ref link 2 (page no-20 in slide)</a></p>
  
  <p>other link suggest 1*n*ln(n) swaps on average</p>
  
  <p><a href="https://stackoverflow.com/questions/21812128/yaroslavskiys-dual-pivot-quick-sort-algorithm/21815999?noredirect=1#21815999">link 1</a></p>
  
  <p><a href="http://permalink.gmane.org/gmane.comp.java.openjdk.core-libs.devel/2628" rel="nofollow noreferrer">ref link 2 (in last-"And as summary")</a></p>
  
  <p>I want to know which one is correct ?</p>