Question

I was looking for an equivalent of *php’s array_multisort* in java.

//array 1
ar1 = array(10, 100, 100, 0);
//array 2
ar2 = array(1, 3, 2, 4);
//calling the function
//this will sort the array at first based one the first array and then based on the    
//second array so these two array are related
array_multisort(ar1, ar2);


//resultant 1st array
array(4) {
[0]=> int(0)
[1]=> int(10)
[2]=> int(100)
[3]=> int(100)  
}

//resultant 2nd array
//this array has been sorted based on the first array at first

array(4) {
[0]=> int(4) // this is associative element of 0 in the first array 
[1]=> int(1) //this is associative element of 10 in the first array 
[2]=> int(2) //this is associative element of  1st 100 from the last in the first array 
             //as there are two 100's , and last one's associative value in the second
             //array is smaller it will come first   
[3]=> int(3)
}

how can i achieve this result using something built-in , i know how to implement it using custom code.

N.B. *Please visit this link before answering the question as that explains how the function should work*

Answer 1

It’s look like that there is not any built-in library function / class for this purpose in Java .
If you are also facing this problem like me , so far Thomas’s answer about the custom code can help you.