title: Number of comparisons in Straight Selection sort
body: <p>I found this question in a Pearson book.</p>
  
  <pre><code>How many comparisons are needed to sort an array of length 5 
  (whose element are already in opposite order) using straight selection sort?
  a. 5
  b. 20
  c. 4
  d. 10
  </code></pre>
  
  <p>It is given that the <strong>correct answer is b. 20</strong></p>
  
  <p>But I think it would be d. 10</p>
  
  <p>Please explain how the answer is 20.</p>
  
  <p>I also Googled for straight selection sort but I am getting only results for Selection sort.
  I also found the term exchange selection sort.
  Till now, I have only heard about Selection sort only, so please give some views on the difference between Exchange and Straight selection sort.</p>
  
  <p>Thanks in advance.</p>