帮忙解决一个简单的java问题

import java.util.*;

public class answer {
public static void main(String[] args){
int[] array = new int[10];
int wantedValue = 0;
Random r = new Random();

for(int i=0;i<10;i++) array[i] = r.nextInt(100);
wantedValue = array[2];

//only to prove the algorithm
for(int i=0;i<10;i++) System.out.println(array[i]);
System.out.println("*****************before sorted**********************");
System.out.println("Here I want to search the third value in the original array, its value is "+array[2]);
//

Arrays.sort(array);//这个方法本身就是快排

//
for(int i=0;i<10;i++) System.out.println(array[i]);
System.out.println("*****************after sorted**********************");
//

search(wantedValue,array);
}
private static void search(int value, int[] aArray){
int pointer = (int)(aArray.