title: Sorting without using divide and conquer algos in less than n*n time
body: <p>Consider the following input :
                      8,4,15,9,32,44,55</p>
  
  <p>Propose an algorithm to sort these in ascending order in less than n*n time complexity.
    Without using any divide and conquer approach</p>