Recursively                      Order of T(n) 
     T(n) = 


1.) 2T(n/2) + O(1)                   O(n)

2.)  T(n/2) + O(1)                   O(logn)

3.) 2T(n/2) + O(n)                   O(nlogn) 

4.)  T(n/2) + O(n)                   O(n)  

5.)  T(n-1) + O(n)                   O(n^2)
    
6.)  T(n-1) + O(1)                   O(n)

7.) aT(n/b) + O(n)                  
       |a==b                         O(nlogn)
       |a>b                          O(n^(logb)a)  
       |a<b                          O(n)

--- Doubtful


8.) aT(n/b) + O(1)                  
       |a==b                         O(n)
       |a>b                          O(n^(a/b))   -- Doubt
       |a<b                          O(n^(a/b))
       |a=1                          O(logn)

      


There are more to be added