title: what will be time complexity if we divide array in log(n) instead of 2?
body: <p>I am trying to improve algorithm for my project.instead of dividing array into 2 part I am planning to divide array in log(n) and remaining part (i.e. (logn-1)(n/logn) ).For example: 
  for n=64 
  log(n)=6
  I will take pass over array and divide it in such way that one part will contain logn=6 and other part will have remaining (64-6)=58 element and I will recursively do that for 6 and 58 till I get 2. i.e. in next pass I will divide 58 in logn=5 and 53 element and for 6 I will divide it into log n=2 and other part will have 4 element.</p>
  
  <p>what will be  time complexity in the end?I am getting nlogn but what will be constant factor along with that ?Can any one help me to find constant factor with nlogn ?</p>