Quick Select algorithm - implementation seems not to function- why?

Question

Hello! I have to work out a essay about the Quick Select algorithm. For this I found a book with implementation code.
But if I implement it in java it does not work.
Here is the code, could you please tell me what's wrong with it?
public class QuickS {
public static void main(String[] args) {
          int [] int_array = {4,0,6,5,3,9,8,2,1,7};
                System.out.println("\n"+quickselect(int_array,9,2));
} //endmethod main
public static int quickselect (int [] array, int len, int k)
          int pivot = len - 1;
          pivot = partition(array, 0, len -1, pivot);
          int rank = pivot + 1;
          if (k == rank)
          {           for (int m= 0; m < array.length; m++)
                    System.out.print(array[m]+" ");
               return pivot;
          if (k < rank)
               return quickselect(array, rank - 1, k);
          else
               return pivot + 1 + quickselect(partArr(array, pivot+1), len - rank, k - rank);
     }  //endmethod quickselect
     public static int partition(int [] array, int l, int r, int pivot)
      int i = l-1;
      int j = r;
      swap(array, pivot, r);
      pivot = r;
      while(i < j)
           do i++; while ((i < j) && (array[i] < array[pivot]));
           do j--; while ((j > i) && (array[j] > array[pivot]));
           if (i >= j)
                swap(array, i, pivot);
           else
                swap(array, i, j);
      } //endwhile
      return i;
   } //endmethod partition
     public static int [] swap(int [] arr, int index1, int index2)
          int tmp = arr[index2];
          arr[index2] = arr[index1];
          arr[index1] = tmp;
          return arr;
     } //endmethod swap
     public static int [] partArr(int [] arr, int index)
          int [] newArr = new int [arr.length-index];
          for (int i = 0, j = index; i < newArr.length; i++, j++)
          newArr[i] = arr[j];
          return newArr;
     } //endmethod partArr
} //endclass QuickS  Please help me! What do you think is sense of the quickselect method? I thought to find out the index of a searched value? e.g. in this case k=2 and the returned value has to be 2 then. But this doesn't work...

Answer 1

Oracle9i Database Concepts
Release 1 (9.0.1)
Part Number A88856-02
PL/SQL Blocks and Roles
The use of roles in a PL/SQL block depends on whether it is an anonymous block or a named block (stored procedure, function, or trigger), and whether it executes with definer rights or invoker rights.
Named Blocks with Definer Rights
All roles are disabled in any named PL/SQL block (stored procedure, function, or trigger) that executes with definer rights. Roles are not used for privilege checking and you cannot set roles within a definer-rights procedure.
The SESSION_ROLES view shows all roles that are currently enabled. If a named PL/SQL block that executes with definer rights queries SESSION_ROLES, the query does not return any rows.
Anonymous Blocks with Invoker Rights
Named PL/SQL blocks that execute with invoker rights and anonymous PL/SQL blocks are executed based on privileges granted through enabled roles. Current roles are used for privilege checking within an invoker-rights PL/SQL block, and you can use dynamic SQL to set a role in the session.