Array in deascending order

Question

Hello ...
if I have the following array:
static float [] in1 = { 0,0,0,80,0,0,100,0,0,90,0,0,70,60};
first I want to sort it so I will have as the following array {100,90,80,70,60,0,0,0,0,0,0,0,0,0}
Then I want an array of the positions of the first ordered values in the original array
I mean that I must have the following
{7,10,4,13,14,0,0,0,0,0}
How can I
1.sort the array (in deascending order)
2.build an array of the positions of the first 10 ordered value (its position in the original array

Answer 1

this is a simple way
O(n^2)
import java.util.*;
public class AT {
static float [] in1 = { 0,0,0,80,0,0,100,0,0,90,0,0,70,60};
public static void main(String [] arg) throws Exception {
float [] a = (float[]) in1.clone();
int [] pos = new int [a.length];
Arrays.sort(a);
for(int j=0; j<a.length/2; j++) {
float tmp = a[j];
a[j]=a[a.length-(j+1)];
a[a.length-(j+1)]=tmp;
for(int j=0; j<a.length; j++) {
while(pos[j]<in1.length && in1[pos[j]]!=a[j])
pos[j]++;
System.out.println(a[j]+" "+pos[j]);
}