title: Sorting array with Negative and Positive Integers
body: <p>Given an array which has <code>n</code> integers, It has both positive and negative integers. Now you need to sort this array in a special way so that after sorting, the negative integers should in the front and the positive integers should be in the back. Also the relative position should not be changed. </p>
  
  <blockquote>
    <p>Ex:
    -1 1 3 -2 2</p>
    
    <p>Ans:
    -1 -2 1 3 2</p>
  </blockquote>
  
  <p>Write an algorithm with the following constraints <code>O(n)</code> time complexity and <code>O(1)</code> space complexity.</p>
  
  <p>With divide and Conquer appraoch I'm coming up with <code>O(nlogn)</code> algorithm. How can we do it more better.</p>