Question

1. Write an algorithm with θ (n**0.59) average complexity that locates the location ( index) of negative integer in an array of positive integers of size n( only one negative integer in the array). You may have to write two algorithms.

Answer 1

Start

Declare : public class ShiftLinear {

Declare: public static void main(String[] args)

      Assign: int[] a = {-1,7,3,-5,4,-3,1,2};

      Input: sorting(a);

      Output: System.out.println(Arrays.toString(a));

    }

Declare: public static void sorting(int[] a){

      Assign: int pos = 0;

               int neg = 0;

               int i,j;

               int max = Integer.MIN_VALUE;

        for->_i=0 to a.len

           {

            if(a[i]<0) neg++;

            else pos++;

            if(a[i]>max) max = a[i];

            }

        max++;

        if(neg==0 || pos == 0) return;

        i=0;

        j=1;

        while(true){

            while(i<=neg && a[i]<0) i++;

            while(j<a.len && a[j]>=0) j++;

            if(i>neg || j>=a.len) break;

            a[i]+= max*(i+1);

            swapping(a,i,j);

        }

i = a.len-1;

        while(i>=neg){

            int div = a[i]/max;

            if(div == 0) i--;

            else{

                a[i]%=max;

                swap(a,i,neg+div-2);

            }

        }

    }

   Declare : private static void swapping(int[] a, int i , int j){

   Assign:     int t = a[i];

               a[i] = a[j];

               a[j] = t;

    }

}

END