title: What is Big Oh notation w.r.t to Sorting algorithms
body: <p>How is Big Oh calculated for sorting algorithms? I have written a program to sort a deck of cards ( n = 52 ) using Selection sort, Merge sort and Insertion sort. For each sorting algorithm, I have to calculate the computation cost. How do I do it?</p>
  
  <p>Now I would be honest enough to admit that it is part of my homework but I am just asking for some help. I am new to the Big Oh notation and went through a couple of websites but couldn't figure it out in terms of sorting algorithms. </p>
  
  <p>Can someone atleast give me hints?</p>
  
  <p>I just referred Wikipedia on Selection sort, Insertion sort &amp; Merge sort. </p>
  
  <p>Insertion Sort:
  Best Case: O(n), Worst Case and Average case: O(n^2)</p>
  
  <p>Selection Sort:
  O(n^2) for all three cases</p>
  
  <p>Merge Sort:
  O(nlog n) for all three cases</p>
  
  <p>Is that true?</p>