Sorting - How selection sort is efficient?
<p>Recently I'm working on analysis of timing of basic sorting algorithms in C# 
<a href="http://www.uomisan.edu.iq/library/admin/book/19226579694.pdf" rel="nofollow">Following this Book</a>. 
On page 55 author mentions, in summary, that. </p>

<blockquote>
  <p>The Selection sort is the most efficient of the algorithms, followed
  by the Bubble sort and the Insertion sort</p>
</blockquote>

<p>but in reality selection sort takes more time than insertion and bubble sort in best,normal &amp; worst Cases.
Even <a href="https://www.toptal.com/developers/sorting-algorithms/" rel="nofollow">this online algorithm visualisation</a> shows selection sort takes more time.</p>

<p>My Question is how selection sort is efficient as compared to Insertion and Bubble sort?</p>