title: Counting Sort - I know how it works but Unable to solve it
body: <p>If certain conditions are fullfilled, counting-sort can sort in linear time. Construct a
  sequence A =&lt; a1; : : : ; a10 > of n = 10 numbers where counting-sort needs theta(n^7) time. Explain your choice.</p>
  
  <p>my approach ;</p>
  
  <p>If i select A = [0,0,0,1,2,3,4,5,6,2], where n=10
  C new would be [3,4,6,7,8,9,10] and B =[ 0,0,0,1,2,2,3,4,5,6]
  This is how counting sort works (according to lectures) but how do i prove it has run time of n power 7? by calculating run time of each step according to pseudo code and then adding? </p>