title: Limitations of comparison based sorting techniques
body: <p>Comparison sort is opted for in most of the scenarios where data needs to be ordered. Techniques like merge sort, quick sort, insertion sort and other comparison sorts can handle different data types and efficiency with a lower limit of O(nLog(n)).</p>
  
  <p>My questions are</p>
  
  <ol>
  <li>Are there any limitations of comparison based sorting techniques?</li>
  <li>Any sort of scenarios where non-comparison sorting techniques would be used?</li>
  </ol>
  
  <p>cheers</p>