The split element of Android interview algorithm problem

.//There is an integer array with negative numbers and integers, with a method to separate positive and negative numbers, requiring a space complexity of O (1), Time complexity is: O (N)/**    *  fractional Group      */   public static void awaylist () {      int  a[] = new int[]{5,-2,4,6,-1,3,-9,-8};      int start  = 0;      int temp = 0;       for (int i=0;i<a.length;i++) {        if (a[i]>0& &start==0) {           continue;         }else if (a[i]<0&&start==0) {            start = i;        }else  if (a[i]>0&&start!=0) {           //No matter what, after the exchange, The next position of start must be less than 0, so STArt++.            temp = a[start];            a[start] = a[i];            a[i] = temp;            if (I>start) {               start++;           }         }      }      for (int  i=0;i<a.length;i++) {        system.out.println (a[i]);       }   }

The split element of Android interview algorithm problem